Skip to content

axiolid-collide ​

Convex collision queries: separating axis, overlap, and separation distance.

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

Overview ​

Convex collision queries by the separating axis theorem: whether two convex shapes overlap and, when they do not, how far apart they are and along which axis. It deliberately does not report penetration depth; callers who need EPA-style contact for physics want a physics engine. For clearance between triangle meshes, use axiolid-inspect.

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

Released under the Mozilla Public License 2.0.