Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane

DOI10.1007/s00453-001-0115-6zbMath1041.68110OpenAlexW2020216359MaRDI QIDQ1849744

Suneeta Ramaswami, Sanguthevar Rajasekaran

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0115-6

zbMATH Keywords

Parallel algorithmsVoronoi diagramsLine segmentsRandomized algorithms.

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (1)

The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs

This page was built for publication: Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane