RANN is a software package for fast nearest neighbor search, wrapping the ANN library (v1.1.3) by Gregory S.X.E. Jefferis. It finds k nearest neighbors for every point in a dataset in O(N log N) time using the L2 (Euclidean) distance metric. The package supports both exact and approximate searches, fixed radius searches, and uses 'bd' as well as 'kd' tree structures.
Use Cases
- Perform exact k-nearest neighbor searches based on Euclidean distance.
- Conduct approximate nearest neighbor searches for faster, large-scale similarity matching.
- Execute fixed-radius neighbor searches to find all points within a specified distance.
- Benchmark search performance using different tree structures ('kd' and 'bd') mentioned in the description.
Strengths
- Implements a proven algorithm (Arya and Mount's ANN library v1.1.3) for efficient O(N log N) search.
- Offers multiple search modes: exact, approximate, and fixed radius.
- Supports two tree data structures ('kd' and 'bd') for flexibility.
Limitations
- Description metadata is limited; actual data quality requires manual inspection after download.
- Column-level documentation is absent; field semantics must be inferred after download.
- Row count and dataset scale are unknown, which may limit suitability assessment.
Provenance
- Source
- Gregory S.X.E. Jefferis
- Collection Method
- Software package wrapping the ANN library.
- Time Range
- null
- Freshness
- Last update date is unknown; freshness unverified.
- Geography
- null