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.

Package details

AuthorSunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis
Date of publication2017-05-21 07:56:50 UTC
MaintainerGregory Jefferis <[email protected]>
LicenseGPL (>= 3)
Version2.5.1
URL https://github.com/jefferis/RANN
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("RANN")

Try the RANN package in your browser

Any scripts or data that you put into this service are public.

RANN documentation built on May 30, 2017, 3:33 a.m.