axiolid-decompose

Convex decomposition of a solid, exact or approximate and always labelled.

Latest release	0.3.3 (2026-11-07)
crates.io	axiolid-decompose
Layer	algorithms (algorithm.discrete)
API documentation	rustdoc · docs.rs
Source	crates/algorithms/discrete/decompose/

Overview

Convex decomposition of a closed triangle-mesh solid. Strategy::Exact splits at reflex features until every part is convex and the union reproduces the input; Strategy::Approximate stops once each part is within a stated concavity bound, giving far fewer parts. The returned Decomposition always says which it is, and the approximate path reports the concavity it actually reached. It works on meshes only, not on exact B-reps.

Depends on

• axiolid-construct
• axiolid-contracts
• axiolid-core
• axiolid-measure
• axiolid-mesh
• axiolid-mesh-boolean-contract
• axiolid-reference

Changes

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