Skip to content

axiolid-arrangement ​

Editable planar subdivision with persistent half-edge topology.

Latest release0.3.1 (2026-09-28)
crates.ioaxiolid-arrangement
Layeralgorithms (algorithm.planar)
API documentationrustdoc · docs.rs
Sourcecrates/algorithms/planar/arrangement/

Overview ​

An editable planar subdivision: a doubly-connected edge list whose vertices, half-edges and faces keep stable handles across edits, so a caller can move a vertex or split a face without rebuilding the plane or losing track of which face is which. Orientation decisions use certified predicates, and the unbounded outer region is a real face. It is deliberately neutral: it exposes faces, boundaries, areas and adjacency, and leaves deciding that a face is a room to the caller. For one-shot polygon booleans with no retained structure, use axiolid-overlay instead.

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/planar/arrangement/CHANGELOG.md

Released under the Mozilla Public License 2.0.