README.md

In krlmlr/RANN1: Fast Nearest Neighbour Search (wraps Arya and Mount's ANN library)

RANN1

Finds the k nearest neighbours using Manhattan distances 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.

For further details on the underlying ANN library, see http://www.cs.umd.edu/~mount/ANN.

This package is essentially identical to the RANN package -- the only difference is that the latter uses Euclidean distances.

Installation

Released versions

The recommendation is to install the released version from CRAN by doing:

install.packages("RANN1")

Bleeding Edge

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")

library(devtools)
install_github("jefferis/RANN1")

Note: Windows users need Rtools and devtools to install this way.

Feedback

Please feel free to:

• submit suggestions and bug-reports at: https://github.com/jefferis/RANN1/issues
• send pull requests after forking: https://github.com/jefferis/RANN1/
• e-mail the maintainer: [e-mail]

Copyright and License

see inst/COPYRIGHT and DESCRIPTION files for copyright and license information.

krlmlr/RANN1 documentation built on May 20, 2019, 6:15 p.m.