CoverTree
Metric neighbor finder
A data structure library for finding nearest neighbors in a general metric space
Python implementation of cover trees, near-drop-in replacement for scipy.spatial.kdtree
31 stars
4 watching
9 forks
Language: Python
last commit: over 12 years ago
Linked from 2 awesome lists
Related projects:
Repository | Description | Stars |
---|---|---|
martibosch/detectree | A Pythonic library for semantic tree segmentation in aerial imagery | 239 |
mrhooray/kdtree-rs | An efficient data structure library for fast geospatial indexing and nearest neighbor searches | 230 |
oturns/geosnap | A Python-based tool for analyzing and visualizing geospatial neighborhood data to support social science research, urban planning, and policy analysis. | 247 |
spotify/annoy | A data structure and search algorithm for finding closest points in high-dimensional space | 13,255 |
bast/flanders | Fast 2D nearest neighbor search with an angle | 7 |
toblerity/rtree | An optimized spatial indexing solution for Python applications. | 630 |
lartpang/pysodmetrics | A library providing an implementation of various metrics for object segmentation and saliency detection in computer vision. | 144 |
dataverselabs/pyinterpolate | A Python package for performing spatial interpolation and analysis using various techniques | 153 |
kristofferc/nearestneighbors.jl | A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 |
martibosch/pylandstats | A Python library for analyzing landscape metrics and evolution | 83 |
jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |
lyst/rpforest | An efficient algorithm for finding approximate nearest neighbors in high-dimensional spaces | 223 |
michaeldorman/nngeo | An R library providing spatial data join capabilities using the k-nearest neighbor algorithm | 79 |
theta-limited/openathena-legacy-python | A tool for processing drone images to extract precise geodetic locations | 84 |
jtsiomb/kdtree | An efficient C library for storing and searching k-dimensional data using a tree-like data structure | 395 |