A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Practical Nearest Neighbor Search in the Plane
[chapter]
2010
Lecture Notes in Computer Science
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.
doi:10.1007/978-3-642-13193-6_42
fatcat:u5fvlyvnrjbdxdehqukx2hxqn4