An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams

DOI10.4230/LIPIcs.ESA.2020.56OpenAlexW3081560103MaRDI QIDQ5874527

Martin Held, Stefan de Lorenzo

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2006.14298

zbMATH Keywords

experimentsVoronoi diagramimplementationexact arithmeticCGALmultiplicative weightadditive weightarc expansionoverlay arrangement

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs

Uses Software

• CGAL

Cites Work

• The overlay of minimization diagrams in a randomized incremental construction
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• The one-dimensional weighted Voronoi diagram
• On the complexity of randomly weighted multiplicative Voronoi diagrams

This page was built for publication: An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams