3300

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

Ophir Setter
Tel-Aviv University
arXiv:0906.2760v1 [cs.CG] (15 Jun 2009)

@article{2009arXiv0906.2760S,

   author={Setter}, O.},

   title={“{Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space}”},

   journal={ArXiv e-prints},

   archivePrefix={“arXiv”},

   eprint={0906.2760},

   primaryClass={“cs.CG”},

   keywords={Computer Science – Computational Geometry},

   year={2009},

   month={jun},

   adsurl={http://adsabs.harvard.edu/abs/2009arXiv0906.2760S},

   adsnote={Provided by the SAO/NASA Astrophysics Data System}

}

Download Download (PDF)   View View   Source Source   

565

views

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 $R^3$. 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 implementations for a vast collection of commonly used Voronoi diagrams. 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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: