Space-time tradeoffs for approximate nearest neighbor searching

Journal of the ACM

Volumn 57, Issue 1, 2009, Pages

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

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

^b UNIVERSITY OF PELOPONNESE   (Greece)

^c Institute of Advanced Computer Science   (United States)

Author keywords

Nearest neighbor searching; Space time tradeoffs

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; APPROXIMATE NEAREST NEIGHBOR SEARCHING; ASYMPTOTIC QUANTITIES; DIMENSIONAL SPACES; FUNDAMENTAL PROBLEM; LOWER BOUNDS; MULTIPLICATIVE ERRORS; NEAREST-NEIGHBOR SEARCHING; QUAD TREES; QUERY POINTS; QUERY TIME; REPRESENTATIVE POINT; SPACE BOUNDS; SPACE COMPLEXITY; SPACE REQUIREMENTS; SPACE-TIME TRADEOFFS; TRADEOFF PARAMETERS;

ASYMPTOTIC ANALYSIS; CONTROL THEORY;

DATA STRUCTURES;

EID: 71449106113     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1613676.1613677     Document Type: Article

References (45)

1. ARYA, S., DA FONSECA, G. D., AND MOUNT, D. M. 2008a. Tradeoffs in approximate range searching made simpler. In SIBGRAPI '08: Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing. IEEE Computer Society, Los Alamitos, CA, 237-244.
2. ARYA, S., AND MALAMATOS, T. 2002. Linear-size approximate Voronoi diagrams. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 147-155.
3. ARYA, S.,MALAMATOS, T., AND MOUNT,D.M. 2002. Space-efficient approximateVoronoi diagrams. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 721-730.
4. ARYA, S., MALAMATOS, T., AND MOUNT, D. M. 2005. Space-time tradeoffs for approximate spherical range counting. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 535-544.
5. ARYA, S.,MALAMATOS, T., AND MOUNT,D.M. 2006. On the importance of idempotence. In Proceedings of the 38th Annual ACM Symposium on Theory Computing. ACM, New York, 564-573.
6. ARYA, S., MALAMATOS, T., AND MOUNT, D. M. 2009. The effect of corners on the complexity of approximate range searching. Disc. Comput. Geom. 41, 398-443.
7. ARYA, S., AND MOUNT, D. M. 2000. Approximate range searching. Comput. Geom. Theory Appl. 17, 135-152.
8. ARYA, S.,MOUNT, D. M.,NETANYAHU, N., SILVERMAN, R., AND WU, A. Y. 1998. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45, 891-923.
9. ARYA, S.,MOUNT, D.M., VIGNERON, A., AND XIA, J. 2008b. Space-time tradeoffs for proximity searching in doubling spaces. In Proceedings of the 16th Annual European Symposium on Algorithms. Lecture Notes Computer Science, vol.LNCS 5193/2008. Springer-Verlag, Berlin, Germany, 112-123.
10. BENT, S. W., SLEATOR, D. D., AND TARJAN, R. E. 1985. Biased search trees. SIAM J. Comput. 14, 545-568.
11. BESPAMYATNIKH, S. N. 1996. Dynamic algorithms for approximate neighbor searching. In Proceedings of the 8th Canadian Conference on Computer Geometry. 252-257.
12. BEYER, K., GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1999. When is "nearest neighbor" meaningful. In Proceedings of the International Conference on Database Theory. 217-235.
13. BRONSHTEYN, E. M. AND IVANOV, L. D. 1976. The approximation of convex sets by polyhedra. Siber. Math. J. 16, 852-853.
14. CALLAHAN, P. B., AND KOSARAJU, S. R. 1995. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 67-90.
15. CHAN, T. M. 1998. Approximate nearest neighbor queries revisited. Disc. Comput. Geom. 20, 359-373.
16. CHAN, T. M. 2002. Closest-point problems simplified on the RAM. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 472-473.
17. CHAN, T. M. 2006. A minimalist's implementation of an approximate nearest neighbor algorithm in fixed dimensions. Manuscript. (*www.cs.vwaterloo. ca/̃tmchan/sss.ps).
18. CHAN, T.M., AND SNOEYINK, J. 1995. Algorithms for approximate nearest-neighbor queries. Manuscript.
19. CLARKSON, K. L. 1994. An algorithm for approximate closest-point queries. In Proceedings of the 10th Annual ACM Symposium on Computer Geometry. ACM, New York, 160-164.
20. CLARKSON, K. L. 1999. Nearest neighbor queries in metric spaces. Disc. Comput. Geom. 22, 63-93.
21. COLE, R., AND GOTTLIEB, L. 2006. Searching dynamic point sets in spaces with bounded doubling dimension. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 574-583.
22. DA FONSECA, G. D. 2007. Approximate range searching in the absolute error model. Ph.D. dissertation, Department of Computer Science, Univ. Maryland.
23. DE BERG, M., VAN KREVELD,M., OVERMARS, M., AND SCHWARZKOPF, O. 2000. Computational Geometry: Algorithms and Applications, 2nd ed. Springer-Verlag, Berlin, Germany.
24. DUDLEY, R. M. 1974. Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory 10, 227-236.
25. DUNCAN, C. A., GOODRICH, M. T., AND KOBOUROV, S. G. 2001. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. J. Algorithms 33, 303-333.
26. EDELSBRUNNER, H. 1987. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, vol.10. Springer-Verlag, Heidelberg, West Germany.
27. EPPSTEIN, D.,GOODRICH,M. T., AND SUN, J.Z. 2008. The skip quadtree:Asimple dynamic data structure for multidimensional data. Int. J. Comput. Geom. Appl. 18, 131-160.
28. FRANÇOIS, D., WERTZ, V., AND VERLEYSEN, M. 2007. The concentration of fractional distances. IEEE Trans. Knowl. Data Eng. 19, 873-886.
29. FREDERICKSON, G. N. 1997. A data structure for dynamically maintaining rooted trees. J. Algorithms 24, 37-65.
30. GANTMACHER, F. R. 1959. Matrix Theory, Volume 2. Chelsea, New York.
31. GOLUB, G. H., AND LOAN, C. F. V. 1996. Matrix Computations, 3rd ed. Johns Hopkins University Press, Baltimore, MD.
32. HAR-PELED, S. 2001. A replacement for Voronoi diagrams of near linear size. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 94-103.
33. HAR-PELED, S. 2008. Geometric approximation algorithms. (Lecture notes available from http://valis.cs.uiuc.edu/̃sariel/teach/notes/aprx/).
34. HAR-PELED, S., AND MENDEL, M. 2006. Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput. 35, 1148-1184.
35. INDYK, P., AND MOTWANI, R. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, 604-613.
36. KARGER, D. R., AND RUHL, M. 2002. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 741-750.
37. KRAUTHGAMER, R., AND LEE, J. R. 2004. Navigating nets: Simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 798-807.
38. KRAUTHGAMER, R., AND LEE, J. R. 2005. The black-box complexity of nearest-neighbor search. Theo. Comp. Sci. 348, 262-276.
39. KUSHILEVITZ, E.,OSTROVSKY, R., AND RABANI,Y. 2000. Efficient search for approximate nearest neighbor in high dimemsional spaces. SIAM J. Comput. 30, 457-474.
40. PANIGRAHY, R. 2006. Entropy based nearest neighbor search in high dimensions. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1186-1195.
41. PREPARATA, F. P., AND SHAMOS,M. I. 1990. Computational Geometry: An Introduction, 3rd ed. Springer- Verlag, Berlin, Germany.
42. SABHARWAL, Y., SEN, S., AND SHARMA, N. 2006. Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. J. Comput. Sys. Sci. 72, 955-977.
43. SAMET, H. 1990. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
44. VLEUGELS, J., AND OVERMARS, M. 1998. Approximating Voronoi diagrams of convex sites in any dimension. Int. J. Comput. Geom. Appl. 8, 201-222. (Pubitemid 128057952)
45. YAO,A.C. 1982. Onconstructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 4, 721-736