Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
Ophir Setter

TL;DR
This paper introduces a flexible divide-and-conquer framework for efficiently computing various types of two-dimensional Voronoi diagrams, including on parametric surfaces, with exact results even in degenerate cases.
Contribution
The authors develop a general envelope-based divide-and-conquer approach for Voronoi diagrams that is adaptable to different site types, distance functions, and surfaces, with near-optimal expected running time.
Findings
Framework supports diagrams on parametric surfaces in R^3.
Expected running time is near-optimal with randomization.
Implemented algorithms for multiple Voronoi diagram types and applications.
Abstract
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional parametric surfaces in . The computation of the diagrams is carried out through the construction of envelopes of surfaces in 3-space provided by CGAL (the Computational Geometry Algorithm Library). The construction of the envelopes follows a divide-and-conquer approach. A straightforward application of the divide-and-conquer approach for computing Voronoi diagrams yields algorithms that are inefficient in the worst case. We prove that through randomization the expected running time becomes near-optimal in the worst case. We show how to employ our framework to realize various types of Voronoi diagrams with different properties by providing…
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.
