Skip to main content
Log in

A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors

  • Published:
Algorithmica Aims and scope Submit manuscript

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+ε ) .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received June 1, 1997; revised March 10, 1998.

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00008263

Navigation