Skip to content
Sections
>> Trisquel >> Packages >> nabia >> gnu-r >> r-cran-rann
nabia  ] [  aramo  ]
[ Source: r-cran-rann  ]

Package: r-cran-rann (2.6.1-1build1)

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.

Other Packages Related to r-cran-rann

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.4)
    GNU C Library: Shared libraries
    also a virtual package provided by libc6-udeb
  • dep: libgcc-s1 (>= 3.0) [amd64]
    GCC support library
    dep: libgcc-s1 (>= 3.5) [armhf]
  • dep: libstdc++6 (>= 4.9)
    GNU Standard C++ Library v3
  • dep: r-api-3.5
    virtual package provided by r-base-core
  • dep: r-base-core (>= 3.6.2.20200221-1build1)
    GNU R core of statistical computation and graphics system

Download r-cran-rann

Download for all available architectures
Architecture Package Size Installed Size Files
amd64 40.9 kB120 kB [list of files]
armhf 37.3 kB99 kB [list of files]