Content deleted Content added
No edit summary |
starting rewrite/fleshing out... |
||
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't 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 Information]
[[Category:Geometric algorithms]]
[[Category:Convex geometry]]
{{stub}}
| |||