[R-pkg-team] Bug#934652: ITP: r-cran-rann -- Fast Nearest Neighbour Search Using L2 Metric

[Steffen Moeller]

Package: wnpp
Severity: wishlist

Subject: ITP: r-cran-rann -- Fast Nearest Neighbour Search Using L2 Metric
Package: wnpp
Owner: Steffen Moeller <moeller at debian.org>
Severity: wishlist

* Package name    : r-cran-rann
  Version         : 2.6.1
  Upstream Author : Sunil Arya and David Mount (for ANN),
* URL             : https://cran.r-project.org/package=RANN
* License         : GPL-3+
  Programming Lang: GNU R
  Description     : 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.

Remark: This package is maintained by Debian R Packages Maintainers at
   https://salsa.debian.org/r-pkg-team/r-cran-rann