A flexible, n-dimensional r*-tree implementation for the Rust ecosystem, suitable for use as a spatial index.
Please refer to the crate README for more information.
An r-tree is a data structure containing spatial data and is optimized for nearest neighbor search. Spatial data refers to an object that has the notion of a position and extent, for example points, lines and rectangles in any dimension.
Primitives are provided for point, line, and rectangle geometries. The geo crate uses rstar as an efficient spatial index and provides RTreeObject implementations for storing complex geometries such as linestrings and polygons.
To run the rstar-demo, checkout the repository and run cargo run rstar-demo in the repository root.
Licensed under either of
at your option.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4
