A unified approach to approximate proximity searching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6346 LNCS, Issue PART 1, 2010, Pages 374-385

  Arya, Sunil ^a   Da Fonseca, Guilherme D ^b   Mount, David M ^c  

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

^b FEDERAL UNIVERSITY OF THE STATE OF RIO DE JANEIRO   (Brazil)

^c University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEAREST NEIGHBOR QUERIES; PROXIMITY QUERIES; PROXIMITY SEARCHING; RANGE QUERY; UNIFIED APPROACH;

DATA STRUCTURES; SPHERES;

QUERY PROCESSING;

EID: 78249262081     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15775-2_32     Document Type: Conference Paper

References (23)

1. Arya, S., da Fonseca, G.D., Mount, D.M.: Tradeoffs in approximate range searching made simpler. In: Proc. 21st SIBGRAPI, pp. 237-244 (2008)
2. Arya, S., Malamatos, T.: Linear-size approximate Voronoi diagrams. In: Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 147-155 (2002)
3. Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate Voronoi diagrams. In: Proc. 34th Ann. ACM Symp. Theory of Comput. (STOC), pp. 721-730 (2002)
4. Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. In: Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 535-544 (2005)
5. Arya, S., Malamatos, T., Mount, D.M.: On the importance of idempotence. In: Proc. 38th ACM Symp. on Theory of Comput. (STOC), pp. 564-573 (2006)
6. Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate nearest neighbor searching. J. ACM 57, 1-54 (2009)
7. Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom. 17, 135-163 (2001)
8. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891-923 (1998)
9. Bespamyatnikh, S.N.: Dynamic algorithms for approximate neighbor searching. In: Proc. 8th Canad. Conf. Comput. Geom. (CCCG), pp. 252-257 (1996)
10. Chan, T.M.: Approximate nearest neighbor queries revisited. Discrete Comput. Geom. 20, 359-373 (1998)
11. Chan, T.M.: Closest-point problems simplified on the ram. In: Proc. 13th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 472-473 (2002)
12. Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. 35(1), 20-35 (2006)
13. Clarkson, K.L.: An algorithm for approximate closest-point queries. In: Proc. 10th Annu. ACM Symp. Comput. Geom. (SoCG), pp. 160-164 (1994)
14. da Fonseca, G.D., Mount, D.M.: Approximate range searching: The absolute model. Comput. Geom. 43(4), 434-444 (2010)
15. Duncan, C.A., Goodrich, M.T., Kobourov, S.: Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. J. Algorithms 38, 303-333 (2001)
16. Eppstein, D., Goodrich, M.T., Sun, J.Z.: The skip quadtree: a simple dynamic data structure for multidimensional data. In: Proc. 21st ACM Symp. Comput. Geom. (SoCG), pp. 296-305 (2005)
17. Funke, S., Malamatos, T., Ray, R.: Finding planar regions in a terrain: in practice and with a guarantee. Internat. J. Comput. Geom. Appl. 15(4), 379-401 (2005)
18. Har-Peled, S.: Notes on geometric approximation algorithms, http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/
19. Har-Peled, S.: A replacement for Voronoi diagrams of near linear size. In: Proc. 42nd Ann. Symp. Foundations of Computer Science (FOCS), pp. 94-103 (2001)
20. Har-Peled, S., Mazumdar, S.: Fast algorithms for comput. the smallest k-enclosing circle. Algorithmica 41(3), 147-157 (2005)
21. Matoušek, J.: Range searching with efficient hierarchical cutting. Discrete Comput. Geom. 10, 157-182 (1993)
22. Matoušek, J., Schwarzkopf, O.: On ray shooting in convex polytopes. Discrete Comput. Geom. 10, 215-232 (1993)
23. Sabharwal, Y., Sen, S., Sharma, N.: Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. J. Comput. Sys. Sci. 72, 955-977 (2006)