axiolid-arrangement

Editable planar subdivision with persistent half-edge topology.

Latest release	0.3.3 (2026-11-07)
crates.io	axiolid-arrangement
Layer	algorithms (algorithm.planar)
API documentation	rustdoc · docs.rs
Source	crates/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

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

Changes

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