Abstract.
We present a randomized algorithm for computing the Voronoi diagram of line segments using coarse-grained parallel machines. Operating on P processors, for any input of n line segments, this algorithm performs O((n log n)/P) local operations per processor, O(n/P) messages per processor, and O(1) communication phases, with high probability for n=Ω(P 3+ε ) .
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received June 1, 1997; revised March 10, 1998.
Rights and permissions
About this article
Cite this article
Xiaotie Deng, ., Binhai Zhu, . A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors . Algorithmica 24, 270–286 (1999). https://doi.org/10.1007/PL00008263
Issue Date:
DOI: https://doi.org/10.1007/PL00008263