RANN
Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
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. The distance is computed using the L2 (Euclidean) metric. Please see package 'RANN.L1' for the same functionality using the L1 (Manhattan, taxicab) metric.
- Version2.6.2
- R versionunknown
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- Last release08/25/2024
Documentation
Team
Gregory Jefferis
MaintainerShow author detailsKirill Müller
Sunil Arya
Show author detailsRolesAuthor, Copyright holderDavid Mount
Show author detailsRolesAuthor, Copyright holderSamuel E. Kemp
Show author detailsRolesAuthorUniversity of Maryland
Show author detailsRolesCopyright holder
Insights
Last 30 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.
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
- Suggests1 package
- Reverse Depends5 packages
- Reverse Imports57 packages
- Reverse Suggests18 packages