论文信息 - Approximate Closest-Point Queries in High Dimensions - 字舞流文

Approximate Closest-Point Queries in High Dimensions

Marshall W. Bern | M. Bern

[1] Pravin M. Vaidya,et al. AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[2] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .

[3] Andrew Chi-Chih Yao,et al. A general approach to d-dimensional geometric queries , 1985, STOC '85.

[4] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[5] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[6] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[7] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..