Can Nearest Neighbor Searching Be Simple and Always Fast?

DOI10.1007/978-3-642-23719-5_8zbMath1347.68339OpenAlexW2816890MaRDI QIDQ3092219

Raimund Seidel, David G. Kirkpatrick, Victor Alvarez

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_8

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Can Nearest Neighbor Searching Be Simple and Always Fast?