An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location

Open Webpage

Richard Cole, Ofer Zajicek

Published: 1990, Last Modified: 12 May 2025J. Parallel Distributed Comput. 1990EveryoneRevisionsBibTeXCC BY-SA 4.0
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 nlog n<math><mtext>n</mtext><mtext>log</mtext><mtext> n</mtext></math> processors.