axiolid-decimate
Edge-collapse mesh decimation with a bounded, reported deviation.
| Latest release | 0.3.1 (2026-09-28) |
| 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
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/decimate/CHANGELOG.md