Expand description
Algorithms needed for distance and penetration depth computation.
Re-exports§
pub use self::epa3::EPA;
Modules§
- Three-dimensional penetration depth queries using the Expanding Polytope Algorithm.
- The Gilbert–Johnson–Keerthi distance algorithm.
- Special support map function like constants and Minkowski sums.
Structs§
- A point of a Configuration-Space Obstacle.
- A simplex of dimension up to 3 that uses Voronoï regions for computing point projections.