axiolid-refine
Mesh refinement and smoothing with bounded, reported deviation.
| Latest release | 0.3.1 (2026-09-28) |
| crates.io | axiolid-refine |
| Layer | algorithms (algorithm.discrete) |
| API documentation | rustdoc · docs.rs |
| Source | crates/algorithms/discrete/refine/ |
Overview
Mesh refinement and Laplacian smoothing with bounded, reported deviation. Refinement splits triangles; when the source surface of a tessellated B-rep is supplied, each new vertex is placed on that surface instead of at the edge midpoint, so refinement converges on the real geometry rather than subdividing the facets. Smoothing keeps boundary vertices bit-identical by default. It does not reduce triangle counts (see axiolid-decimate) and does not implement limit-surface subdivision schemes.
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/refine/CHANGELOG.md