axiolid-collide

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

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

• axiolid-core

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