Divide and conquer algorithms for closest point problems in multidimensional space.
作者： Jon Louis Bentley
DOI:
关键词: Dichotomic search 、 Multidimensional space 、 Computer science 、 Theoretical computer science 、 Divide and conquer algorithms 、 Closest point
摘要:
acm.org 参考文章(20)
M. AdelsonVelskii, AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION ,(1963)
René Descartes, Rules for the Direction of the Mind ,(2020)
G. Polya, A. Robson, How to Solve It ,(1945)
Richard B. Kieburtz, Structured programming and problem solving with ALGOL W ,(1975)
Joseph B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society. ,vol. 7, pp. 48- 50 ,(1956) , 10.1090/S0002-9939-1956-0078686-7
H. Loberman, A. Weinberger, Formal Procedures for Connecting Terminals with a Minimum Total Wire Length Journal of the ACM. ,vol. 4, pp. 428- 437 ,(1957) , 10.1145/320893.320896
C.T. Zahn, Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters IEEE Transactions on Computers. ,vol. C-20, pp. 68- 86 ,(1971) , 10.1109/T-C.1971.223083
Robert F. Sproull, William M. Newman, Principles of Interactive Computer Graphics ,(1973)
W. A. Burkhard, R. M. Keller, Some approaches to best-match file searching Communications of the ACM. ,vol. 16, pp. 230- 236 ,(1973) , 10.1145/362003.362025
C. J. van Rijsbergen, The best-match problem in document retrieval Communications of the ACM. ,vol. 17, pp. 648- 649 ,(1974) , 10.1145/361179.361205