RANN (Q36005)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | RANN |
Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric |
Statements
24 August 2026
0 references
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.
0 references
Samuel E. Kemp
0 references
