Sciweavers

WEA
2010
Springer
280views Algorithms» more  WEA 2010»
13 years 10 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar