On k-Nearest Neighbor Voronoi Diagrams in the Plane
暂无分享,去创建一个
[1] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[2] Der-Tsai Lee. On Finding K Nearest Neighbors in the Plane , 1976 .
[3] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[4] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.
[5] C. A. Rogers,et al. Packing and Covering , 1964 .
[6] Forest Baskett,et al. An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.
[7] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[8] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[9] C. Quesenberry,et al. A nonparametric estimate of a multivariate density function , 1965 .
[10] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..
[11] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.
[12] Robert E. Tarjan,et al. Application of a Planar Separator Theorem , 1977, FOCS.
[13] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.
[14] Franco P. Preparata,et al. A New Approach to Planar Point Location , 1981, SIAM J. Comput..
[15] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[16] I. G. Gowda,et al. Dynamic problems in computational geometry , 1981 .
[17] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.
[18] J. Bentley. A survey of techniques for fixed radius near neighbor searching. , 1975 .
[19] Franco P. Preparata,et al. Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..