### Abstract

Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.

Original language | English (US) |
---|---|

Pages (from-to) | 280-285 |

Number of pages | 6 |

Journal | Journal of Parallel and Distributed Computing |

Volume | 8 |

Issue number | 3 |

DOIs | |

State | Published - 1990 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science Applications
- Hardware and Architecture
- Control and Systems Engineering

### Cite this

**An optimal parallel algorithm for building a data structure for planar point location.** / Cole, Richard; Zajlcek, Ofer.

Research output: Contribution to journal › Article

*Journal of Parallel and Distributed Computing*, vol. 8, no. 3, pp. 280-285. https://doi.org/10.1016/0743-7315(90)90103-V

}

TY - JOUR

T1 - An optimal parallel algorithm for building a data structure for planar point location

AU - Cole, Richard

AU - Zajlcek, Ofer

PY - 1990

Y1 - 1990

N2 - Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.

AB - Using a modification of the Approximate Parallel Scheduling of R. Cole and U. Vishkin (SIAM J. Comput. 17, 11988),128-142), we give an optimal parallel algorithm for generating a linear size data structure for planar point location that supports an O(log n) query time. Our algorithm runs on a CREW PRAM in time O(log n) using n log n processors.

UR - http://www.scopus.com/inward/record.url?scp=0025402346&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025402346&partnerID=8YFLogxK

U2 - 10.1016/0743-7315(90)90103-V

DO - 10.1016/0743-7315(90)90103-V

M3 - Article

AN - SCOPUS:0025402346

VL - 8

SP - 280

EP - 285

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 3

ER -