RANN: Fast Nearest Neighbour Search

Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount's ANN library (v1.1.1). Two functions allow searches for nearest neighbours within a point set or between two separate point sets. There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees. This version updates ANN 1.1.3 and fixes package compilation on Windows.

Version: 2.1.3
Published: 2011-10-19
Author: Samuel E. Kemp, Gregory Jefferis
Maintainer: Gregory Jefferis <jefferis at gmail.com>
License: GPL-2
CRAN checks: RANN results

Downloads:

Package source: RANN_2.1.3.tar.gz
MacOS X binary: RANN_2.1.3.tgz
Windows binary: RANN_2.1.3.zip
Reference manual: RANN.pdf
Old sources: RANN archive

Reverse dependencies:

Reverse suggests: caret, spdep