axiolid-triangulate

Constrained Delaunay triangulation with bounded quality refinement.

Latest release	0.3.2 (2026-09-28)
crates.io	axiolid-triangulate
Layer	algorithms (algorithm.planar)
API documentation	rustdoc · docs.rs
Source	crates/algorithms/planar/triangulate/

Overview

Constrained Delaunay triangulation with bounded quality refinement. Every constraint edge survives as a union of output edges, the result is Delaunay away from the constraints (decided by the certified incircle predicate), and optional Ruppert refinement drives interior angles toward a caller-chosen minimum. Refinement carries an explicit Steiner budget and reports when it was capped, so an unmet angle bound is never returned silently.

Depends on

• axiolid-core
• axiolid-guarantees
• axiolid-predicates

Changes

Latest release, 0.3.2 (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/planar/triangulate/CHANGELOG.md