Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 19:47, 29 November 2005

Revision as of 06:37, 28 December 2005

Line 1:

The '''Gilbert-Johnson-Keerthi''' distance [[algorithm]] is a method of determining the minimum distance between two [[convex]] shapes. Unlike many other distance algorithms, it doesn'tdoes 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]].

==External links==

*[http://intl.ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=614298 More Informationhttp://intl.ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=614298]

[http://intl.ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=614298 More Information]

[[Category:Geometric algorithms]]

[[Category:Convex geometry]]

{{Math-stub}}