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.
| Version: | 2.6.2 |
| Suggests: | testthat |
| Published: | 2024-08-25 |
| DOI: | 10.32614/CRAN.package.RANN |
| Author: | Gregory Jefferis |
| Maintainer: | Gregory Jefferis <jefferis at gmail.com> |
| BugReports: | https://github.com/jefferislab/RANN/issues |
| License: | GPL (≥ 3) |
| URL: | https://github.com/jefferislab/RANN, https://jefferislab.github.io/RANN/ |
| NeedsCompilation: | yes |
| Materials: | README, NEWS |
| CRAN checks: | RANN results |
| Reference manual: | RANN.html , RANN.pdf |
| Package source: | RANN_2.6.2.tar.gz |
| Windows binaries: | r-devel: RANN_2.6.2.zip, r-release: RANN_2.6.2.zip, r-oldrel: RANN_2.6.2.zip |
| macOS binaries: | r-release (arm64): RANN_2.6.2.tgz, r-oldrel (arm64): RANN_2.6.2.tgz, r-release (x86_64): RANN_2.6.2.tgz, r-oldrel (x86_64): RANN_2.6.2.tgz |
| Old sources: | RANN archive |
Please use the canonical form https://CRAN.R-project.org/package=RANN to link to this page.
Need a high-speed mirror for your open-source project?
Contact our mirror admin team at info@clientvps.com.
This archive is provided as a free public service to the community.
Proudly supported by infrastructure from VPSPulse , RxServers , BuyNumber , UnitVPS , OffshoreName and secure payment technology by ArionPay.