axiolid-ray-mesh

Narrow-phase ray/triangle-mesh nearest-hit intersection.

Latest release	0.4.0 (2026-09-28)
crates.io	axiolid-ray-mesh
Facade	axiolid feature ray-mesh
Layer	algorithms (algorithm.query)
API documentation	rustdoc · docs.rs
Source	crates/algorithms/query/intersection/ray-mesh/

Overview

Narrow-phase ray/triangle-mesh intersection: the nearest hit with its parameter, barycentric coordinates and a certified front/back/coplanar side. It composes with a broad phase such as axiolid-spatial by taking candidate triangle indices, but does not depend on one. Degenerate triangles are refused rather than silently missed. It owns the intersection only, not what a ray means to the caller.

Depends on

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

Changes

Latest release, 0.4.0 (2026-09-28):

Changed

• Breaking: a candidate triangle index at or beyond the mesh's triangle count is refused with the new RayMeshError::TriangleIndexOutOfRange instead of being skipped by nearest_hit_among; a broad phase built over a different mesh would otherwise report "no hit" for triangles it never tested. triangle_hit refuses the same index instead of panicking in the mesh view.
• 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/ray-mesh/CHANGELOG.md