Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 16:40, 10 March 2006

Revision as of 00:37, 11 July 2006

Line 1:

The '''Gilbert-Johnson-Keerthi distance [[algorithm]]''' is a method of determining the minimum distance between two [[convex set]] shapess. 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 points to the correct answer.

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