Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection
- 1 December 1991
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 31 (4) , 558-565
- https://doi.org/10.1007/bf01933171
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximate Distributions of Order StatisticsPublished by Springer Nature ,1989
- Plane-sweep solves the closest pair problem elegantlyInformation Processing Letters, 1988
- A worst-case analysis of nearest neighbor searching by projectionPublished by Springer Nature ,1980
- An Algorithm for Finding Nearest NeighborsIEEE Transactions on Computers, 1975