RANN: Fast Nearest Neighbour Search (wraps Arya and Mount's ANN library)

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.3). There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees.

Version: 2.3.0
Published: 2013-07-24
Author: Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis
Maintainer: Gregory Jefferis <jefferis at gmail.com>
License: GPL (≥ 3)
Copyright: ANN library is copyright University of Maryland and Sunil Arya and David Mount. See file COPYRIGHT for details.
NeedsCompilation: yes
Materials: NEWS
CRAN checks: RANN results


Reference manual: RANN.pdf
Package source: RANN_2.3.0.tar.gz
OS X binary: RANN_2.3.0.tgz
Windows binary: RANN_2.3.0.zip

Reverse dependencies:

Reverse depends: McSpatial, RapidPolygonLookup, StatMatch, unbalanced
Reverse imports: nat
Reverse suggests: caret, fscaret, GeoXp, LICORS, spdep