axiolid-linear-intersection
Portable, deterministic intersections for linear geometry.
| Latest release | 0.3.1 (2026-09-28) |
| crates.io | axiolid-linear-intersection |
| Facade | axiolid feature linear-intersection |
| Layer | algorithms (algorithm.query) |
| API documentation | rustdoc · docs.rs |
| Source | crates/algorithms/query/intersection/linear/ |
Overview
Certified 2D intersections for lines and segments, with a minimal dependency closure so a line-query application does not pull in curves, surfaces, meshes or B-rep (ADR 0036). Results are classifications, not optional points: crossing, endpoint contact, parallel-disjoint, coincident, collinear-disjoint and overlap are distinct variants. Topology comes from certified predicates; the tolerance only governs acceptance of the computed coordinate. Invalid input is a typed refusal naming the operand.
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/query/intersection/linear/CHANGELOG.md