Revision as of 02:19, 29 September 2006 edit Brighterorange (talk \| contribs) Administrators 13,302 edits m fix redlink ← Previous edit		Revision as of 05:12, 15 March 2007 edit undo Utku a (talk \| contribs) 71 edits No edit summary Next edit →
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 points 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]].

Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions