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.
[email protected] low health (42/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/conda/r-rnanoflannFirst published · 2025-12-31 14:39:49.413000+00:00
Last updated · 2025-12-31 14:44:17.310000+00:00