Sciweavers

Share
WEA
2010
Springer

Practical Nearest Neighbor Search in the Plane

10 years 1 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 and faster than the state of the art in practice. The algorithm and proof are both simple and the experimental results clearly show that we can beat the state of the art on most distributions in two dimensions.
Michael Connor, Piyush Kumar
Added 18 May 2010
Updated 18 May 2010
Type Conference
Year 2010
Where WEA
Authors Michael Connor, Piyush Kumar
Comments (0)
books