flanders
Nearest neighbor search algorithm
Fast 2D nearest neighbor search with an angle
Fast 2D nearest neighbor search with an angle.
7 stars
5 watching
1 forks
Language: Rust
last commit: over 1 year ago anglekd-treenearest-neighbor-searchpython
Related projects:
Repository | Description | Stars |
---|---|---|
| A library for efficient searching of high-dimensional data points using graph and tree-based methods | 1,272 |
| Fast point-in-polygon test and distance calculations for polygons in 2D space | 15 |
| An efficient algorithm for finding approximate nearest neighbors in high-dimensional spaces | 225 |
| A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 |
| A data structure and search algorithm for finding closest points in high-dimensional space | 13,321 |
| A data structure library for finding nearest neighbors in a general metric space | 31 |
| An efficient data structure library for fast geospatial indexing and nearest neighbor searches | 236 |
| A high-performance approximate nearest neighbors search library for Ruby | 52 |
| An R library providing spatial data join capabilities using the k-nearest neighbor algorithm | 79 |
| A Ruby wrapper around the Annoy C++ library for efficient nearest neighbor searches | 34 |
| A web assembly-based vector similarity search engine that uses k-d tree for fast search and indexing. | 892 |
| Provides a fast 2D spatial index solution for efficient point searches | 11 |
| An efficient spatial index implementation for nearest neighbor search in n-dimensional spaces | 419 |
| Provides Ruby bindings for a C++ library implementing approximate nearest neighbor search | 15 |
| An implementation of the K Nearest Neighbors algorithm using Scheme and Racket | 16 |