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.
- Version0.0.3
- R versionunknown
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- Last release05/17/2024
Documentation
Team
Manos Papadakis
Michail Tsagris
Show author detailsRolesContributorJose Luis Blanco
Show author detailsRolesAuthor, Copyright holder
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package
- Linking To2 packages
- Reverse Imports3 packages