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.
This package implements the Manhattan (L1) metric. For the Euclidean (L2) metric, install the RANN package.
For further details on the underlying ANN library, see http://www.cs.umd.edu/~mount/ANN.
The recommendation is to install the released version from CRAN by doing:
install.packages("RANN.L1")You can, however, download the tar ball, and run R CMD INSTALL on it, or use the devtools package to install the development version:
# install.packages("devtools")
devtools::install_github("jefferis/RANN@master-L1")Note: Windows users need Rtools and devtools to install this way.
Please feel free to:
- submit suggestions and bug-reports at: https://github.com/jefferis/RANN/issues
- send pull requests after forking: https://github.com/jefferis/RANN/
- e-mail the maintainer: jefferis@gmail.com
see inst/COPYRIGHT and DESCRIPTION files for copyright and license information.