RANN

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.

Total

226,719

Last month

8,699

Last week

2,355

Average per day

290

Daily downloads

Total downloads

Description file content

Package
RANN
Title
Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
Author
Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis
Maintainer
Gregory Jefferis
Copyright
ANN library is copyright University of Maryland and Sunil Arya and David Mount. See file COPYRIGHT for details.
Description
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.
URL
BugReports
https://github.com/jefferis/RANN/issues
Encoding
UTF-8
License
GPL (>= 3)
Suggests
testthat
Version
2.5.1
RoxygenNote
6.0.1
NeedsCompilation
yes
Packaged
2017-05-19 13:52:30 UTC; jefferis
Repository
CRAN
Date/Publication
2017-05-21 07:56:50 UTC

install.packages('RANN')

2.5.1

7 months ago

https://github.com/jefferis/RANN

Gregory Jefferis

GPL (>= 3)

Suggests

testthat

Discussions