axiolid-route

Exact planar shortest path over a visibility graph.

Latest release	0.4.0 (2026-11-13)
crates.io	axiolid-route
Facade	axiolid feature route
Layer	algorithms (algorithm.planar)
API documentation	rustdoc · docs.rs
Source	crates/algorithms/planar/route/

Overview

Exact planar shortest paths over a visibility graph, plus distance maps, farthest points and forced walks built on the same graph. Which edges exist is decided with certified orient2d, so the combinatorics are exact; path lengths are sums of square roots in f64 and carry ordinary rounding. Oversized input is refused with a proven lower bound rather than truncated, and the budget is a caller parameter. It reports routes and typed unreachable reasons, never whether a route is acceptable. For grid-sampled routing over layered fields, see axiolid-field-ops.

Depends on

• axiolid-contracts
• axiolid-core
• axiolid-guarantees
• axiolid-overlay
• axiolid-predicates
• axiolid-triangulate

Changes

Latest release, 0.4.0 (2026-11-13):

Changed

• Breaking: requires axiolid-overlay 0.4, whose OverlayError is #[non_exhaustive] with the new HolesOverlap and PolygonsOverlap, and whose Region::new refuses rings that cross into each other. skeleton and CostRegion::new take overlay's Polygon, so a caller builds it with overlay 0.4 (#448, ADR 0104).

Full history: crates/algorithms/planar/route/CHANGELOG.md