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

@article{Setter2009ConstructingTV,
  title={Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space},
  author={Ophir Setter and M. Sharir and D. Halperin},
  journal={2009 Sixth International Symposium on Voronoi Diagrams},
  year={2009},
  pages={43-52}
}
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… Expand
The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
Arrangements on Parametric Surfaces II: Concretizations and Applications
28 Arrangements
Non-centered Voronoi Skeletons
Network Farthest-Point Diagrams
...
1
2
...

References

SHOWING 1-10 OF 181 REFERENCES
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
Divide-and-conquer for Voronoi diagrams revisited
The voronoi diagram of three lines
The Voronoi Diagram of Planar Convex Objects
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Bregman Voronoi Diagrams
Order-k voronoi diagrams of sites with additive weights in the plane
...
1
2
3
4
5
...