RANN: Fast Nearest Neighbour Search
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). Two functions allow searches for nearest neighbours
within a point set or between two separate point sets. There is
support for approximate as well as exact searches, fixed radius
searches and bd as well as kd trees.
| Version: |
2.2.1 |
| Published: |
2012-11-02 |
| Author: |
Samuel E. Kemp, Gregory Jefferis |
| Maintainer: |
Gregory Jefferis <jefferis at gmail.com> |
| License: |
GPL-2 |
| NeedsCompilation: |
yes |
| CRAN checks: |
RANN results |
Downloads:
Reverse dependencies: