# RANN v2.6.1

0

0th

Percentile

## Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric

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.

# RANN

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 nearest neighbors for the Euclidean (L2) metric. For the Manhattan (L1) metric, install the RANN1 package.

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

## Installation

### Released versions

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

install.packages("RANN")


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

devtools::install_github("jefferis/RANN")


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

## Feedback

Please feel free to:

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

## Functions in RANN

 Name Description nn2 Nearest Neighbour Search RANN-package Wrapper for Arya and Mount's Approximate Nearest Neighbours (ANN) C++ library No Results!