Gilbert–Johnson–Keerthi distance algorithm

The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a computational geometry algorithm used for determining the distance between convex shapes in space, particularly in robotics and computer graphics. It is widely utilized for collision detection, where understanding the proximity of objects is essential. ### Key Features of the GJK Algorithm: 1. **Convex Shapes**: The GJK algorithm is specifically designed for convex shapes.