Practical nearest neighbor search in the plane

Authors:
Michael Connor;Piyush Kumar
Affiliations:
Department of Computer Science, Florida State University, Tallahassee, FL;Department of Computer Science, Florida State University, Tallahassee, FL
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 8
Cited 0

Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Triangulations in CGAL (extended abstract)

Proceedings of the sixteenth annual symposium on Computational geometry
Finding nearest neighbors in growth-restricted metrics

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Closest-point problems simplified on the RAM

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
The skip quadtree: a simple dynamic data structure for multidimensional data

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 $\mathcal{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.