RANN.L1: Fast Nearest Neighbour Search (Wraps ANN Library) Using L1
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 L1
(Manhattan, taxicab) metric. Please see package 'RANN' for the same
functionality using the L2 (Euclidean) metric.
| Version: |
2.5 |
| Suggests: |
testthat |
| Published: |
2015-05-04 |
| Author: |
Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis,
Kirill Müller |
| Maintainer: |
Kirill Müller <krlmlr+r at mailbox.org> |
| License: |
GPL (≥ 3) |
| Copyright: |
ANN library is copyright University of Maryland and Sunil
Arya and David Mount. See file COPYRIGHT for details. |
| URL: |
https://github.com/jefferis/RANN/tree/master-L1 |
| NeedsCompilation: |
yes |
| Materials: |
README NEWS |
| CRAN checks: |
RANN.L1 results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=RANN.L1
to link to this page.