axiolid-minkowski

Minkowski sum and difference of planar-faced solids.

Latest release	0.3.1 (2026-09-28)
crates.io	axiolid-minkowski
Layer	algorithms (algorithm.discrete)
API documentation	rustdoc · docs.rs
Source	crates/algorithms/discrete/minkowski/

Overview

Minkowski sum and difference of closed planar-faced (triangle-mesh) solids. The sum of two convex solids is computed exactly as the hull of pairwise vertex sums; non-convex operands are decomposed into convex parts and the pairwise sums unioned through a caller-supplied mesh Boolean provider, under a budget. The difference is computed as an erosion, not as a hull of pairwise differences, and refuses a non-convex subject rather than return a result that is too large. Curved operands are refused.

Depends on

• axiolid-construct
• axiolid-contracts
• axiolid-core
• axiolid-decompose
• axiolid-mesh
• axiolid-mesh-boolean-contract

Changes

Latest release, 0.3.1 (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/discrete/minkowski/CHANGELOG.md