Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Setter, O. ; Sch. of Comput. Sci., Tel-Aviv Univ., Tel-Aviv, Israel ; Sharir, M. ; Halperin, D.

We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. 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 two 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.Additional material is available at: http://acg.cs.tau.ac.il/projects/internal-projects/vd-via-dc-of-envelopes/project-page.

Published in:

Voronoi Diagrams, 2009. ISVD '09. Sixth International Symposium on

Date of Conference:

23-26 June 2009