axiolid-spatial
Acceleration structures: BVH and uniform point grid, and their queries; barycentric and mean-value coordinates.
| Latest release | 0.3.2 (2026-09-28) |
| crates.io | axiolid-spatial |
| Facade | axiolid feature spatial |
| Layer | algorithms (algorithm.query) |
| API documentation | rustdoc · docs.rs |
| Source | crates/algorithms/query/spatial/ |
Overview
Deterministic, callback-based spatial acceleration: a median-split BVH over bounded objects and a uniform grid for point KNN and radius search, both behind the SpatialIndex query contract. They return candidates only, never exact intersections. It also provides barycentric and mean-value coordinates for interpolating values given at triangle, tetrahedron and polygon corners.
Depends on
Changes
Latest release, 0.3.2 (2026-09-28):
Changed
- The crates.io page is this crate's own
README.md, with links to its API documentation, its reference page and the source (ADR 0078).
Full history: crates/algorithms/query/spatial/CHANGELOG.md