Gilbert–Johnson–Keerthi distance algorithm

Detects intersection between two convex shapes.

Given a function that returns the point in the shape which maximizes the scalar product with a direction d, and a centroid of the shape for each shape, I return if any two intersect.

Credit:

• A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)

---