routledgehandbooks.com参考文章(63)
Piotr Indyk, Nearest Neighbors in High-Dimensional Spaces Handbook of Discrete and Computational Geometry, Second Edition. pp. 877- 892 ,(2004) , 10.1201/9781420035315.CH39
Kurt Mehlhorn, Best possible bounds on the weighted path length of optimum binary search trees Springer, Berlin, Heidelberg. pp. 31- 41 ,(1975) , 10.1007/3-540-07407-4_4
Ketan Mulmuley, Computational geometry : an introduction through randomized algorithms Prentice-Hall. ,(1994)
Donald Ervin Knuth, Sorting and Searching ,(1973)
Steven Fortune, Voronoi Diagrams and Delaunay Triangulations Handbook of Discrete and Computational Geometry, Second Edition. pp. 377- 388 ,(2004) , 10.1201/9781420035315.CH23
Franz Aurenhammer, Voronoi diagrams—a survey of a fundamental geometric data structure ACM Computing Surveys. ,vol. 23, pp. 345- 405 ,(1991) , 10.1145/116873.116880
Kenneth L. Clarkson, An algorithm for approximate closest-point queries Proceedings of the tenth annual symposium on Computational geometry - SCG '94. pp. 160- 164 ,(1994) , 10.1145/177424.177609
K. Ruben Gabriel, Robert R. Sokal, A New Statistical Approach to Geographic Variation Analysis Systematic Biology. ,vol. 18, pp. 259- 278 ,(1969) , 10.2307/2412323
Richard Cole, Searching and Storing Similar Lists ,(2011)
Ho-Yam Addy Fu, Sunil Arya, Expected-case complexity of approximate nearest neighbor searching symposium on discrete algorithms. pp. 379- 388 ,(2000) , 10.5555/338219.338583