Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 21:05, 1 July 2009

Revision as of 15:04, 27 July 2009

Line 1:

[[File:Two types of collisions and corresponding CSO faces.svg|550px|thumb|right|The two types of collision and corresponding CSO face: face-vertex (top) and edge-edge (bottom).]]

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]]es to the correct answer using the [[Minkowski sum]] (CSO) of two convex shapes.