A lower bound on Voronoi diagram complexity

Information Processing Letters

Volumn 83, Issue 4, 2002, Pages 183-185

  Aronov, Boris ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Computational complexity; Computational geometry; Voronoi diagram

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTERPOLATION; PERTURBATION TECHNIQUES; SET THEORY; THEOREM PROVING;

VORONOI DIAGRAM;

COMPUTATIONAL GEOMETRY;

EID: 0037206191     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00336-2     Document Type: Article

References (13)

1. Voronoi diagrams: A survey of a fundamental geometric data structure
2. Voronoi diagrams
3. Voronoi diagrams in higher dimensions under certain polyhedral distance functions
4. Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
5. Algorithms in combinatorial geometry
6. Voronoi diagrams and arrangements
7. Voronoi diagrams and Delaunay triangulations
8. Voronoi diagrams and Delaunay triangulations
9. Intersection and proximity problems and Voronoi diagrams
10. Almost tight upper bounds for lower envelopes in higher dimensions
11. Arrangements in higher dimensions: Voronoi diagrams, motion planning and other applications
12. A new technique for analyzing substructures in arrangements of piecewise linear surfaces