Binary package “r-cran-rann” in ubuntu focal
Fast Nearest Neighbour Search 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.
Source package
Published versions
- r-cran-rann 2.6.1-1build1 in amd64 (Proposed)
- r-cran-rann 2.6.1-1build1 in amd64 (Release)
- r-cran-rann 2.6.1-1build1 in arm64 (Proposed)
- r-cran-rann 2.6.1-1build1 in arm64 (Release)
- r-cran-rann 2.6.1-1build1 in armhf (Proposed)
- r-cran-rann 2.6.1-1build1 in armhf (Release)
- r-cran-rann 2.6.1-1build1 in ppc64el (Proposed)
- r-cran-rann 2.6.1-1build1 in ppc64el (Release)
- r-cran-rann 2.6.1-1build1 in riscv64 (Release)
- r-cran-rann 2.6.1-1build1 in s390x (Proposed)
- r-cran-rann 2.6.1-1build1 in s390x (Release)
