Searching dynamic point sets in spaces with bounded doubling dimension

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 574-583

  Cole, Richard ^a   Gottlieb, Lee Ad ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Approximate nearest neighbor search

Indexed keywords

APPROXIMATION THEORY; ASPECT RATIO; DATA STRUCTURES; STATE SPACE METHODS;

APPROXIMATE NEAREST NEIGHBOR SEARCH; DOUBLING DIMENSION; DYNAMIC POINT SETS; SUPPORTS INSERTIONS;

SET THEORY;

EID: 33748092859     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132599     Document Type: Conference Paper

References (16)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions, J. ACM, 45(6):891-923, 1998.
2. A. Bagchi, A. L. Buchsbaum and M. T. Goodrich. Biased skip lists. Algorithmica, 42(1):31-48, 2005.
3. S. W. Bent, D. D. Sleator and R. E. Tarjan. Biased search trees. SIAM J. Comput., 14(3):545-68, 1985.
4. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. J. Alg., 1(4):301-358, 1980.
5. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. Manuscript.
6. P. B. Callahan and S. R. Kosaraju. A decomposition of multi-dimensional point sets with applications to k-nearest-neighbors and n-body potential fields. ACM Symposium on Theory of Computing, 1992, 546-556.
7. E. Chavez, G. Navarro, R. Baeza-Yates, and J. L. Marroquin. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273-321, September 2001.
8. K. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput., 17:830-847, 1988.
9. K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Computational Geometry, 22(1):63-93, 1999.
10. R. Cole and R. Hariharan. Dynamic lea queries. SIAM J. on Comput., 34(4):894-923, 2005.
11. G. N. Frederickson. A data structure for dynamically maintaining rooted trees. J. Alg., 24(1):37-65, 1997.
12. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. IEEE Symposium on Foundations of Computer Science, 2003, 534-543.
13. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics, and their applications. ACM Symposium on Computational Geometry, 2005, 150-158.
14. D. Karger and M. Ruhl. Finding nearest neighbors In growth-restricted metrics. ACM Symposium on Theory of Computing, 2002, 63-66.
15. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. ACM-SIAM Symposium on Discrete Algorithms, 2004, 798-807.
16. R. Krauthgamer and J. R. Lee. The black-box complexity of nearest neighbor search. Theoretical Computer Science, 348(2-3):262-276, 2005.