Timothy M. Chan
- 1.P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Cornput. Geom., 6:407-422, 1991. Google Scholar
Digital Library
- 2.P. K. Agarwal and J. Matou#k. Ray shooting and parametric search. SIAM J. Comput., 22:764-806, 1993. Google ScholarDigital Library
- 3.S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Prec. #th A CM. SIAM Syrnpos. Discrete Algorithms, pages 271-280, 1993. Google Scholar
- 4.S. Ary# and D. M. Mount. Approximate range searching. In Prec. 11 th A CM Sympos. Cornput. Geom., pages 172-181, 1995. Google ScholarDigital Library
- 5.S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, a#d A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Prec. 5th A CM-SIAM Syrnpos. Discrete Algorithms, pages 573-582, 1994. Google ScholarDigital Library
- 6.S. Arya, D. M. Mount, and O. Naraya#. Accounting for boundary effects in nearest neighbor searching. Discrete Comput. Geom., 16:155-176, 1996.Google ScholarDigital Library
- 7.M. Bern. Approximate closest-point queries in high dimensions. Inform. Process. Left., 45:95-99, 1993. Google ScholarDigital Library
- 8.P. B. Ca/laha# amd S. R. Kosaxaju. Faster algorithms for some geometric graph problems in higher dimensions. In Prec. #th A CM-SIAM Sympos. Discrete Algorithms, pages 291-300, 1993. Google ScholarDigital Library
- 9.B. Cha#elle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Corn. put., 21:671-696, 1992. Google ScholarDigital Library
- 10.K. L. Clarkson. An algorithm for approximate closestpoint queries. In Prec. l Oth A CM Sympos. Cornput. Geom., pages 160-164, 1994. Google ScholarDigital Library
- 11.S. Kapoor and M. Smid. New techniques for exact and approximate dynamic closest-point problems. SlAM J. Comput., 25:775-796, 1996. Google ScholarDigital Library
- 12.J. Matou#ek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Cornput. Geom., 10:215- 232, 1993.Google ScholarDigital Library
- 13.F. P. Preparata and M. I. Shamos. Computational Geometry: Aa Introduction. Springer-Veflag, New York, 1985. Google ScholarDigital Library
- 14.J.S. Salowe. Construction of multidimensional spanner graphs, with applications to minimum spaani-g trees. In Prec. 7th A CM Syrnpos. Cornput. Geom., page, 256- 261, 1991. Google ScholarDigital Library
- 15.P. M. Vaidya. A sparse graph almost as good as the complete graph on points in k dimensions. Discrete Cornput. Geom., 6:369-381, 1991.Google ScholarDigital Library
- 16.A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11:721-736, 1982.Google ScholarDigital Library
Index Terms
- Approximate nearest neighbor queries revisited
Recommendations
Nearest neighbor queries
SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of dataA frequently encountered type of query in Geographic Information Systems is to find the k nearest neighbor objects to a given point in space. Processing such queries requires substantially different search algorithms than those for location or range ...
Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph
SISAP '09: Proceedings of the 2009 Second International Workshop on Similarity Search and ApplicationsRetrieving the \emph{k-nearest neighbors} of a query object is a basic primitive in similarity searching. A related, far less explored primitive is to obtain the dataset elements which would have the query object within their own \emph{k}-nearest ...
Nearest neighbor queries
A frequently encountered type of query in Geographic Information Systems is to find the k nearest neighbor objects to a given point in space. Processing such queries requires substantially different search algorithms than those for location or range ...
Comments