Simple and fast nearest neighbor search

2010 Proceedings of the 12th Workshop on Algorithm Engineering and Experiments, ALENEX 2010

Volumn , Issue , 2010, Pages 43-54

  Birn, Marcel ^a   Holtgrewe, Manuel ^a   Sanders, Peter ^a   Singler, Johannes ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING; INDUSTRIAL ENGINEERING;

FAST NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBOR QUERIES; POINT SET;

NEAREST NEIGHBOR SEARCH;

EID: 84880384348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972900.5     Document Type: Conference Paper

References (13)

1. N. Amenta, S. Choi, and G. Rote. Incremental constructions con brio. In 19th Symposium on Computational Geometry, pages 211-219, 2003.
2. S. Arya, D. M. Mount, and M. H. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In 35th Symposium on Foundations of Computer Science, pages 703-712, 1994.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
4. J.-D. Boissonnat and M. Teillaud. The hierarchical representation of objects: The Delaunay tree. In ACM Symposium on Computational Geometry, pages 260- 268, 1986.
5. CGAL consortium. Computational geometry algorithms library. http://www.cgal.org/.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.
7. O. Devillers. The Delaunay hierarchy. International Journal of Foundations of Computer Science, 13:163- 180, 2002.
8. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In 7th Workshop on Experimental Algorithms (WEA), pages 319-333, 2008.
9. L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7(4):381-413, 1992.
10. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In 11th Canadian Conference on Computational Geometry, 1999.
11. D. M. Mount and S. Arya. ANN: A library for approximate nearest neighbor searching. CGC 2nd Annual Fall Workshop on Computational Geometry, 1997.
12. D. Schultes and P. Sanders. Dynamic highway-node routing. In 6th Workshop on Experimental Algorithms (WEA), pages 66-79, 2007.
13. A. C.-C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, 1982.