Package: RANN 2.6.2

Gregory Jefferis

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.

Authors:Gregory Jefferis [aut, cre], Samuel E. Kemp [aut], Kirill Müller [ctb], Sunil Arya [aut, cph], David Mount [aut, cph], University of Maryland [cph]

RANN_2.6.2.tar.gz
RANN_2.6.2.zip(r-4.5)RANN_2.6.2.zip(r-4.4)RANN_2.6.2.zip(r-4.3)
RANN_2.6.2.tgz(r-4.4-x86_64)RANN_2.6.2.tgz(r-4.4-arm64)RANN_2.6.2.tgz(r-4.3-x86_64)RANN_2.6.2.tgz(r-4.3-arm64)
RANN_2.6.2.tar.gz(r-4.5-noble)RANN_2.6.2.tar.gz(r-4.4-noble)
RANN_2.6.2.tgz(r-4.4-emscripten)RANN_2.6.2.tgz(r-4.3-emscripten)
RANN.pdf |RANN.html✨
RANN/json (API)
NEWS

Peer review:

Bug tracker:https://github.com/jefferislab/rann/issues

On CRAN:

ann-librarynearest-neighborsnearest-neighbours

1 exports 58 stars 7.86 score 0 dependencies 169 dependents 12 mentions 1.1k scripts 26.7k downloads

Last updated 18 days agofrom:d45c95d3ff. Checks:OK: 9. Indexed: yes.

Exports:nn2

Dependencies: