We present a parallel algorithm which constructs the Voronoi diagram of a planar n-point set within a square window. When the points are independently drawn from a uniform distribution, the algorithm runs in O(log n) expected time on CRCW PRAM with O(n/log n) processors. The fast operation of the algorithm results from the efficiency of a new multi-level bucketing technique convenient in processor assignment. The concurrent write is used only for the distribution of points in their home buckets in the bottom level.
CITATION STYLE
Levcopoulos, C., Katajainen, J., & Lingas, A. (1988). An optimal expected-time parallel algorithm for Voronoi diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 318 LNCS, pp. 190–198). Springer Verlag. https://doi.org/10.1007/3-540-19487-8_21
Mendeley helps you to discover research relevant for your work.