Fast construction of nets in low dimensional metrics, and their applications

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 150-158

  Har Peled, Sariel ^a   Mendel, Manor ^a,b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximate distance oracle; Approximate nearest neighbor search; Compact representation scheme; Doubling metrics; Spanners; Well separated pair decomposition

Indexed keywords

APPROXIMATE DISTANCE ORACLE; APPROXIMATE NEAREST NEIGHBOR SEARCH; COMPACT REPRESENTATION SCHEME; DOUBLING METRICS; SPANNERS; WELL SEPARATED PAIR DECOMPOSITION;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FUNCTIONS; LINEAR EQUATIONS;

ALGORITHMS;

EID: 33244493557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064117     Document Type: Conference Paper

References (23)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. Assoc. Comput. Mach., 45(6), 1998.
2. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
3. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. Assoc. Comput. Mach., 42:67-90, 1995.
4. K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci., pages 226-232, 1983.
5. K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Comput. Geom., 22(1):63-93, 1999.
6. K. L. Clarkson. Nearest neighbor searching in metric spaces: Experimental results for sb(s). Available from http://cm.bell-labs.con/who/clarkson/Msb/ white_paper.pdf, 2002.
7. T. Feder and D.. H. Greene. Optimal algorithms for approximate clustering. In Proc. 20th Annu. ACM Sympos. Theory Comput., pages 434-444, 1988.
8. T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., 38:293-306, 1985.
9. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graphs. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 828-837. Society for Industrial and Applied Mathematics, 2002.
10. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. H. M. Smid. Approximate distance oracles revisited. In Proc. 13th Annu. Internat. Sympos. Algorithms Comput., pages 357-368. Springer-Verlag, 2002.
11. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proc. 44th Annu. IEEE Sympos. Found. Comput. Sci., pages 534-543, 2003.
12. S. Har-Peled. A replacement for Voronoi diagrams of near linear size. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 94-103, 2001.
13. S. Har-Peled. Clustering motion. Discrete Comput. Geom., 31(4):545-565, 2004.
14. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. In Proc. 36th Annu. ACM Sympos. Theory Comput., pages 291-300, 2004.
15. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics, and their applications. Available from http://arxiv.org/abs/ca.DS/ 0409057, 2005.
16. J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
17. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proc. 34th Annu. ACM Sympos. Theory Comput., pages 741-750. ACM Press, 2002.
18. R. Krauthgamer and J. R. Lee. The black-box complexity of nearest neighbor search. In Proc. 31st Internat. Colloq. Automata Lang. Prog., pages 858-869, 2004.
19. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 798-807. Society for Industrial and Applied Mathematics, 2004.
20. N. Bull. London Math. Soc., 34(6):667-676, 2002.
21. K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proc. 36th Annu. ACM Sympos. Theory Comput., pages 281-290. ACM Press, 2004.
22. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd Annu. ACM Sympos. Theory Comput., pages 183-192. ACM Press, 2001.
23. P. M. Vaidya. An optimal algorithm for the all-nearest-neighbors problem. In Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., pages 117-122, 1986.