krlmlr/RANN1: 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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis |
| Maintainer | Gregory Jefferis <jefferis@gmail.com> |
| License | GPL (>=3) |
| Version | 2.4.1 |
| URL | https://github.com/jefferis/RANN1 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
