Approximate closest-point queries in high dimensions

Information Processing Letters - Tập 45 - Trang 95-99 - 1993
Marshall Bern1
1Xerox Corporation, Palo Alto Research Center, Palo Alto, CA 94304, USA

Tài liệu tham khảo

Bentley, 1980, Optimal expected-time algorithms for closest point problems, ACM Trans. Math. Software, 6, 563, 10.1145/355921.355927

Dobkin, 1976, Multidimensional search problems, SIAM J. Comput., 5, 181, 10.1137/0205015

Finkel, 1974, Quad trees - a data structure for retrieval on composite keys, Acta Inform., 4, 1, 10.1007/BF00288933

Friedman, 1977, An algorithm for finding best matches in logarithmic expected time, ACM Trans. Math. Software, 3, 209, 10.1145/355744.355745

Samet, 1984, The quadtree and related hierarchical data structures, Computing Surveys, 16, 188, 10.1145/356924.356930

Samet, 1990

Vaidya, 1989, An O(n log n) algorithm for the all-nearest-neighbors problem, Discrete Comput. Geom., 4, 101, 10.1007/BF02187718

Yao, 1985, A general approach to d-dimensional geometric queries, Proc. 17th Ann. ACM Symp. Theory of Computing, 163

Thông tin
Thông tin xuất bản

Information Processing Letters

Tập 45

95-99

Thông tin tác giả