jefferis/RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
Version 2.5.1

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.

Getting started

Package details

AuthorSunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis
MaintainerGregory Jefferis <[email protected]>
LicenseGPL (>=3)
Version2.5.1
URL https://github.com/jefferis/RANN
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("devtools")
library(devtools)
install_github("jefferis/RANN")
jefferis/RANN documentation built on June 5, 2017, 6:07 p.m.