RANN: Fast Nearest Neighbour Search (Wraps Arya and Mount's ANN
Library)
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.
| Version: |
2.5 |
| Suggests: |
testthat |
| Published: |
2015-04-20 |
| Author: |
Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis |
| Maintainer: |
Gregory Jefferis <jefferis at gmail.com> |
| 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 |
| NeedsCompilation: |
yes |
| Materials: |
README NEWS |
| CRAN checks: |
RANN results |
Downloads:
Reverse dependencies:
| Reverse depends: |
celestial, McSpatial, RapidPolygonLookup, RWBP, saasCNV, StatMatch |
| Reverse imports: |
gjam, ldbod, lidR, ProbitSpatial, RsimMosaic, spatialEco, unbalanced |
| Reverse suggests: |
agricolae, caret, dimRed, flacco, fscaret, GeoXp, LICORS, nabor, spdep |
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=RANN
to link to this page.