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

摘要

We present a general framework for computing Voronoi diagrams of different classes of sites under various distance functions in R2. Most diagrams mentioned in the paper are in the plane. However, the framework is sufficiently general to support diagrams embedded on a family of two-dimensional parametric surfaces in three-dimensions. 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 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 also show how to apply the new framework and other existing tools from Cgal to compute minimum-width annuli of sets of disks, which requires the computation of two Voronoi diagrams of different types, and of the overlay of the two diagrams. We do not assume general position. Namely, we handle degenerate input, and produce exact results.