Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Content deleted Content added
See also: Add SAT page link under see also
Tags: Mobile edit Mobile web edit
m link [dD]ot product
Line 14:
GJK relies on two functions:
 
* <math>\mathrm{Support}(\mathrm{shape}, \vec{d})</math>, which returns the point on {{math|shape}} which has the highest [[dot product]] with <math>\vec{d}</math>.
* <math>\mathrm{NearestSimplex}(s)</math>, which takes a simplex {{mvar|s}} and returns the simplex on {{mvar|s}} closest to the origin, and a direction toward the origin normal to the new simplex. If {{mvar|s}} itself contains the origin, {{math|NearestSimplex}} accepts {{mvar|s}} and the two shapes are determined to intersect.