New upper bounds for neighbor searching
Open Access
- 31 March 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 68 (1-3), 105-124
- https://doi.org/10.1016/s0019-9958(86)80030-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- On k-Nearest Neighbor Voronoi Diagrams in the PlaneIEEE Transactions on Computers, 1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973