Nothing
Rnanoflann: Extremely Fast Nearest Neighbor Search
Finds the k nearest neighbours for every point in a given dataset using Jose Luis' 'nanoflann' library. There is support for exact searches, fixed radius searches with 'kd' trees and two distances, the 'Euclidean' and 'Manhattan'. For more information see <https://github.com/jlblancoc/nanoflann>. Also, the 'nanoflann' library is exported and ready to be used via the linking to mechanism.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Manos Papadakis [aut, cre, cph], Jose Luis Blanco [aut, cph], Michail Tsagris [ctb] |
| Maintainer | Manos Papadakis <papadakm95@gmail.com> |
| License | GPL (>= 3) |
| Version | 0.0.1 |
| URL | https://github.com/ManosPapadakis95/Rnanoflann |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the Rnanoflann package in your browser
Any scripts or data that you put into this service are public.
