Package: r-cran-rann (2.6.2-1)

[ Source: r-cran-rann  ]

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

• dep: libc6 (>= 2.17)

  GNU C 라이브러리: 공유 라이브러리
  also a virtual package provided by libc6-udeb

• dep: libgcc-s1 (>= 3.0)

  GCC 기능 지원 라이브러리

• dep: libstdc++6 (>= 13.1)

  GNU 표준 C++ 라이브러리 v3

• dep: r-api-4.0

  virtual package provided by r-base-core

• rec: r-cran-testthat

  GNU R testsuite

Download r-cran-rann

Download for all available architectures

Architecture	Package Size	Installed Size	Files
ppc64el	45.1 kB	196.0 kB	[list of files]