sif-rtree
Spatial index
An immutable data structure for efficiently storing and querying spatial data in 2D space
simple, immutable, flat R-tree
5 stars
1 watching
1 forks
Language: Rust
last commit: 8 months ago
Linked from 1 awesome list
r-treerustspatial-index
Related projects:
Repository | Description | Stars |
---|---|---|
stefansalewski/rtree | A data structure for efficient spatial searching and indexing of objects in high-dimensional space. | 26 |
georust/rstar | An efficient spatial index implementation for nearest neighbor search in n-dimensional spaces | 419 |
davidmoten/rtree | An in-memory R-tree implementation for efficient spatial indexing and search in Java with reactive API support | 1,094 |
armon/erl-rstar | A high-performance data structure for efficient spatial indexing and querying of multi-dimensional data | 59 |
tidwall/rtree | An in-memory R-tree implementation designed for fast spatial searching and indexing | 316 |
plokhotnyuk/rtree2d | A high-performance 2D spatial indexing library for efficient nearest and intersection queries | 132 |
kylebarron/geo-index | A Rust library that implements a static spatial index data structure optimized for performance and memory efficiency. | 78 |
mrhooray/kdtree-rs | An efficient data structure library for fast geospatial indexing and nearest neighbor searches | 236 |
alyst/spatialindexing.jl | Efficient in-memory indexing of spatial data | 32 |
toblerity/rtree | An optimized spatial indexing solution for Python applications. | 635 |
pka/rust-kdbush | Provides a fast 2D spatial index solution for efficient point searches | 11 |
mourner/flatbush | A fast and efficient spatial index for 2D points and rectangles in JavaScript | 1,429 |
jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |
wwaites/linkedspatialindex | A system for efficiently searching and indexing spatial data in linked data systems. | 5 |
juliageo/libspatialindex.jl | A Julia wrapper around a spatial indexing library for efficient storage and querying of 2D data. | 10 |