Optimal bucket size for nearest neighbor searching in k-d trees
- 1 August 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 12 (4) , 165-167
- https://doi.org/10.1016/0020-0190(81)90092-2
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Extended K-D tree database organization: a dynamic multi-attribute clustering methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multidimensional Binary Search Trees in Database ApplicationsIEEE Transactions on Software Engineering, 1979
- Common Properties of Some Multiattribute File SystemsIEEE Transactions on Software Engineering, 1979
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977