Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 05:13, 15 March 2007

Revision as of 18:00, 13 May 2007

Line 1:

The '''Gilbert-Johnson-Keerthi distance [[algorithm]]''' is a method of determining the minimum distance between two [[convex set]]s. 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 (mathematics)|support function]] to iteratively generate closer [[Simplex_algorithm|simplexes]] to the correct answer using [[minkowski sum]](CSO) of two convex shapes.

The algorithm's stability, speed, and small storage footprint make it popular for realtime [[collision detection]], especially in [[physics engine]]s for [[video games]].