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

DOI10.4230/LIPICS.ESA.2020.56OpenAlexW3081560103MaRDI QIDQ5874527FDOQ5874527

Authors: M. Held, Stefan de Lorenzo 

Publication date: 7 February 2023

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

zbMATH Keywords

implementationVoronoi diagramexperimentsexact arithmeticCGALmultiplicative weightadditive weightarc expansionoverlay arrangement

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (3)

• An analytical representation of the 2d generalized balanced power diagram
• An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
• On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs

Uses Software

• CGAL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874527)