Expand description

The Gilbert–Johnson–Keerthi distance algorithm.

Enums

Results of the GJK algorithm.

Functions

Casts a ray on a support map using the GJK algorithm.
Projects the origin on a shape using the Separating Axis GJK algorithm. The algorithm will stop as soon as the polytope can be proven to be at least max_dist away from the origin.
Compute the distance that can travel g1 along the direction dir so that g1 and g2 just touch.
The absolute tolerence used by the GJK algorithm.
Projects the origin on the boundary of the given shape.