Installation
About
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.
| github.com/jefferis/RANN | |
| Copyright | ANN library is copyright University of Maryland and Sunil Arya and David Mount. See file COPYRIGHT for details. |
| Bug report | File report |
Key Metrics
Downloads
| Yesterday | 1.366 0% |
| Last 7 days | 5.812 -23% |
| Last 30 days | 26.927 -13% |
| Last 90 days | 83.859 -5% |
| Last 365 days | 349.223 +3% |