Spade (SPAtial DatastructurEs, obviously!) implements a few nifty data structures for spatial access operations:
- An n-dimensional r*-tree for efficient nearest-neighbor and point lookup queries. Note that a faster successor is available with the rstar crate.
- 2D Delaunay triangulation, optionally backed by an r-tree for faster insertion and nearest neighbor lookup
- 2D constrained Delaunay triangulation (CDT)
Some other noteworthy features:
- natural neighbor interpolation on this triangulation
- Precise and adaptive calculation methods to avoid rounding issues
- supports serde with the
serde_serializefeature
All structures are purely written in rust, the package currently supports vectors from the nalgebra and cgmath packages. However, using these packages is not required.
Spade complies with semantic versioning, and since it is past its 1.0 version, current minor version changes will be backward compatible. However, due to the way cargo resolves dependencies, there might be issues when using spade combined with cgmath or nalgebra: every time spade updates these libraries, the using code must be update too, even if spade would still work happily with an older version. To avoid this, consider switching to fixed size arrays as points, implementing your own point type or do some creative hacking into your cargo.lock to force cargo into using the correct cgmath / nalgebra version.
The documentation can be found on docs.rs. There is also a user guide available.
Spade is being passively maintained, please file all bugs that you can find! However, I don't plan any major release at the moment. Spade's r-tree has been split off into the smaller rstar crate which is the recommended replacement. rstar compiles faster, runs faster and is more actively developed.
This image shows the structure of an r*-tree with some points inserted in a circular pattern.
Points are shown as blue dots, the tree's directory nodes are displayed as boxes of different colors (depending on their depth in the tree).
Note that the implementation tries prevent any boxes from overlapping, resulting in faster query performance. You can find this example in /examples/interactivedemo, run it with cargo run rtree.
CDT's are usual Delaunay triangulations with a few "fixed" edges:
The user guide has a an own chapter about interpolation, along with some nice images.
An example showcasing spade's interpolation features can be found in /examples/nninterpolation, run it with cargo run.
Neither spade's triangulation nor r-tree were optimized to be exceptionally fast. The library focussed on a rich and high quality feature set and an early 1.0 release at the cost of performance. Compared to any GCed language, spade's performance is likely better (feel free to contribute a benchmark!) but it is by far not in the same ballpark as its C/C++ contenders like CGAL. However, for many use cases, spade will hopefully be fast enough and a viable rust only alternative.
The user guide contains detailed graphs, benchmarks and more information about the delaunay triangulation's performance.
Licensed under either of
- Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.