axiolid-decimate

Edge-collapse mesh decimation with a bounded, reported deviation.

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

Overview

Edge-collapse decimation of triangle meshes with a bounded, reported deviation. The caller asks for a triangle budget or a maximum deviation; either way the result never moves a vertex further than the caller's bound, and DecimateReport states the collapses performed, the refusals by cause and the largest distance any vertex actually moved. Collapses that would invert a triangle or create a non-manifold edge are refused. Output is deterministic. It does not remesh isotropically, detect sharp features or use quadric error metrics: the cost is edge length and the new vertex is the edge midpoint. For adding triangles instead, see axiolid-refine.

Depends on

• axiolid-core
• axiolid-measure
• axiolid-mesh

Changes

Latest release, 0.3.4 (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/decimate/CHANGELOG.md