Weighted Voronoi-Delaunay dual on polyhedral surfaces and its finiteness
Xiang Zhu

TL;DR
This paper provides a rigorous proof of the existence and uniqueness of weighted Voronoi and Delaunay structures on polyhedral surfaces, extending previous methods with a new isotopic map approach.
Contribution
It introduces a new proof technique for weighted Voronoi and Delaunay decompositions on polyhedral surfaces, avoiding edge-flipping algorithms.
Findings
Established existence and uniqueness of weighted Voronoi decompositions
Constructed an isotopic map as a proof method
Supported the existence of inversive distance circle packings
Abstract
We aim to give a strict proof of the existence and uniqueness of the weighted Voronoi decomposition and the dual weighted Delaunay triangulation on Euclidean and hyperbolic polyhedral surface as well as hyperbolic surface with geodesic boundaries. Since the former definition of the Voronoi cell may not be simply connected, we slightly adjust the definition. Our proof is to construct an isotopic map instead of using the edge-flipping algorithm, which is a generalization of the one by Dyer et al. The main theorem of this paper is a lemma for proving the existence of the inversive distance circle packing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Historical Geography and Cartography · Evacuation and Crowd Dynamics
