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

DOI10.1016/j.comgeo.2022.101935OpenAlexW4292941503WikidataQ114195425 ScholiaQ114195425MaRDI QIDQ2096374

Peter Palfrader, Stefan de Lorenzo, Günther Eder, Martin Held

Publication date: 16 November 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101935

zbMATH Keywords

Voronoi diagramrecognitionreconstructionbisector graphmultiplicative weight

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computing methodologies and applications (68Uxx) Polytopes and polyhedra (52Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Recognizing Dirichlet tesselations
• Recognising polytopical cell complexes and constructing projection polyhedra
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• Representing Directed Trees as Straight Skeletons
• Recognizing Voronoi Diagrams with Linear Programming
• Weighted Voronoi Diagrams in the Maximum Norm
• Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
• An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams

This page was built for publication: On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs