Polyhedral Voronoi diagrams of polyhedra in three dimensions

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 227-236

  Koltun, Vladlen ^a   Sharir, Micha ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Polyhedral distance function; Polyhedral sites; Three dimensions; Voronoi diagrams

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES;

POLYHEDRAL SITES;

COMPUTATIONAL GEOMETRY;

EID: 0036362651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513428     Document Type: Conference Paper

References (20)

1. The overlay of lower envelopes and its applications
2. Arrangements and their applications
3. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions
4. On translational motion planning of a convex polyhedron in 3-space
5. The union of convex polyhedra in three dimensions
6. Voronoi diagrams
7. Voronoi diagrams in higher dimensions under certain polyhedral distance functions
8. 1 Voronoi diagram of moving points
9. Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
10. Voronoi diagrams and arrangements
11. Voronoi diagrams and Delaunay triangulations
12. New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
13. A replacement for Voronoi diagrams of near linear size
14. A tight bound for the complexity of Voronoi diagrams under polyhedral convex distance functions in 3D
15. Almost tight upper bounds for vertical decompositions in four dimensions
16. Three dimensional Euclidean Voronoi diagrams of lines with a fixed number of orientations
17. Closest-point problems
18. Almost tight upper bounds for lower envelopes in higher dimensions