axiolid-spatial

Acceleration structures: BVH and uniform point grid, and their queries; barycentric and mean-value coordinates.

Latest release	0.3.6 (2026-11-07)
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, mean-value, Wachspress and discrete harmonic coordinates for interpolating values given at triangle, tetrahedron, polygon and closed-triangle-mesh corners.

Depends on

• axiolid-core

Changes

Latest release, 0.3.6 (2026-11-07):

Added

• The package now ships LICENSE and LICENSE-COMMERCIAL (symlinks to the repository root), so the licence texts travel with the archive (#358).

Full history: crates/algorithms/query/spatial/CHANGELOG.md