A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions

DOI10.1016/S0166-218X(00)00235-3zbMath0967.68162WikidataQ126470690 ScholiaQ126470690MaRDI QIDQ5929327

Ulrich Kühn

Publication date: 4 April 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

planar Voronoi diagramsrandomized parallel algorithm

Mathematics Subject Classification ID

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

Related Items (1)

The geometry of Minkowski spaces -- a survey. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Concrete and abstract Voronoi diagrams
• Parallel sorting by regular sampling
• A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
• ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
• A Separator Theorem for Planar Graphs
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Optimal Search in Planar Subdivisions
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS

This page was built for publication: A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions