Content deleted Content added
550px is way too wide for a lede image. |
|||
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.
Line 7 ⟶ 6:
The algorithm's stability, speed, and small storage footprint make it popular for realtime [[collision detection]], especially in [[physics engine]]s for [[video games]].
== Illustration==
<center>
▲[[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).]]
</center>
==External links==
| |||