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. The distance is computed using the L2 (Euclidean) metric. Please see package 'RANN.L1' for the same functionality using the L1 (Manhattan, taxicab) metric.

Documentation

Manual: RANN.pdf
Vignette: None available.

Maintainer: Gregory Jefferis <jefferis at gmail.com>

Author(s): Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis

Install package and any missing dependencies by running this line in your R console:

install.packages("RANN")

Depends
Imports
Suggests testthat
Enhances
Linking to
Reverse
depends
celestial, McSpatial, RapidPolygonLookup, RWBP, saasCNV, StatMatch
Reverse
imports
ck37r, gjam, ldbod, lidR, ProbitSpatial, RsimMosaic, spatialEco, unbalanced
Reverse
suggests
agricolae, caret, dimRed, flacco, fscaret, GeoXp, LICORS, nabor, spdep
Reverse
enhances
Reverse
linking to

Package RANN
Materials
URL https://github.com/jefferis/RANN
Task Views
Version 2.5.1
Published 2017-05-21
License GPL (>= 3)
BugReports https://github.com/jefferis/RANN/issues
SystemRequirements
NeedsCompilation yes
Citation
CRAN checks RANN check results
Package source RANN_2.5.1.tar.gz