A tight bound for the complexity of Voronoi diagrams under polyhedral convex distance functions in 3D

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 316-321

  Icking, C ^a   Ma, L ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Bisector; Complexity; Convex distance function; Convex polytope; Lower envelope; Polyhedron; Voronoi diagram

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; FUNCTIONS; PROBABILITY;

POLYHEDRAL CONVEX DISTANCE FUNCTIONS; VORONOI DIAGRAMS;

COMBINATORIAL MATHEMATICS;

EID: 0034819543     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Voronoi diagrams
2. Voronoi diagrams in higher dimensions under certain polyhedral distance functions
3. Voronoi diagrams based on convex distance functions
4. Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
5. Applications of random sampling in computational geometry II
6. 3 with applications to Crum's problem and Knuth's post-office problem
7. Voronoi diagrams and arrangements
8. Voronoi diagrams and Delaunay triangulations
9. Voronoi diagrams of moving points in the plane
10. Computing convolutions by reciprocal search
11. Convex distance functions in 3-space are different
12. On bisectors for convex distance functions in 3-space
13. On bisectors for different distance functions
14. Voronoi diagrams based on general metrics in the plane
15. Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
16. On the construction of abstract Voronoi diagrams
17. Algorithmic motion planning in robotics
18. Almost tight upper bounds for lower envelopes in higher dimensions
19. Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
20. A new technique for analyzing substructures in arrangements of piecewise linear surfaces