Space-efficient approximate Voronoi diagrams

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 721-730

  Arya, Sunil ^a   Malamatos, Theocharis ^a   Mount, David M ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; QUERY LANGUAGES; SET THEORY;

APPROXIMATE NEAREST NEIGHBOR QUERIES; APPROXIMATE VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 0036036847     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.510011     Document Type: Conference Paper

References (13)

1. Linear-size approximate voronoi diagrams
2. Approximate range searching
3. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
4. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
5. Approximate nearest neighbor queries revisited
6. An algorithm for approximate closest-point queries
7. Metric entropy of some classes of sets with differentiable boundaries
8. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
9. A replacement for Voronoi diagrams of near linear size
10. Approximate nearest neighbors: Towards removing the curse of dimensionality
11. Efficient search for approximate nearest neighbor in high dimensional spaces
12. Improved space bound for approximate Voronoi diagram
13. Approximating voronoi diagrams of convex sites in any dimension