Refinements to nearest-neighbor searching ink-dimensional trees
- 1 June 1991
- journal article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 6 (1-6), 579-589
- https://doi.org/10.1007/bf01759061
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975