CGAL 5.6.3 - dD Spatial Searching

Loading...
Searching...
No Matches
Bibliography

[1]

  S. Arya and D. M. Mount. Algorithms for fast vector quantization. In Data Compression Conference, pages 381–390. IEEE Press, 1993.

[2]

  S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 271–280, 1993.

[3]

  J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509–517, September 1975.

[4]

  J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3:209–226, 1977.

[5]

  G. R. Hjaltason and H. Samet. Ranking in spatial databases. In M. J. Egenhofer and J. R. Herring, editors, Advances in Spatial Databases - Fourth International Symposium, number 951 in Lecture Notes Comput. Sci., pages 83–95, August 1995.