A replacement for Voronoi diagrams of near linear size

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 94-103

  Har Peled, S ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; SET THEORY; THEOREM PROVING;

VORONOI DIAGRAMS;

COMPUTATIONAL COMPLEXITY;

EID: 0035172304     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959884     Document Type: Conference Paper

References (18)

1. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions
2. Efficient algorithms and regular data structures for dilation, location and proximity problems
3. An optimal algorithm for approximate nearest neighbor searching fixed dimensions
4. Voronoi diagrams: A survey of a fundamental geometric data structure
5. Provably good mesh generation
6. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
7. Approximate nearest neighbor queries revisited
8. Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm
9. An algorithm for approximate closest-point queries
10. Nice points sets can have nasty delaunay triangulations
11. Data structures for on-line updating of minimum spanning trees, with applications
12. A replacement for voronoi diagrams of near linear size
13. Approximate nearest neighbors: Towards removing the curse of dimensionality
14. Efficient search for approximate nearest neighbor in high dimensional spaces
15. Preserving order in a forest in less than logarithmic time and linear space