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>. Al
[email protected] is safe to use (health: 44/100)
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/cran/RnanoflannFirst published · 2024-05-17 15:49:56
Last updated · 2024-05-17T13:10:02+00:00