logo

Video encyclopedia

Gilbert–Johnson–Keerthi distance algorithm

0:35

GJK-based collision detection & response

1:27

GJK Collision Detection and Resolution

1:31

Approximate collision distance with GJK

3:40

[Graphics] Hierarchy,Trees, GJK algorithm

0:11

GJK village tour(1)

The Gilbert–Johnson–Keerthi distance algorithm is a method of determining the minimum distance between two convex sets. Unlike many other distance algorithms, it does not require that the geometry data be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.
    Explore contextually related video stories in a new eye-catching way. Try Combster now!