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 0(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.