Home › Per Ericson Ch. 9, the GJK algorithm finds colli…
Per Ericson Ch. 9, the GJK algorithm finds collision between two CONVEX shapes by which iteration?
ABuild a simplex inside the Minkowski difference toward origin
BCompute the convex hull of all combined vertices
CSample random points and test inclusion in both shapes
DRasterise both shapes to a shared bitmap and AND
Answer & Solution
Correct answer: A. Build a simplex inside the Minkowski difference toward origin
Ericson Ch. 9.5 GJK: build simplex points in A − B that approach the origin. Origin inside the simplex means the shapes overlap.
Related questions
For broad-phase collision, SWEEP-AND-PRUNE (a.k.a. sort-and-sweep) achieves average perforPer Ericson + Catto, COULOMB FRICTION at a contact is typically modelled with friction forPer Erin Catto (Box2D), CONSTRAINT-BASED simulation solves contacts and joints using whichPer Ericson Ch. 6 + Erin Catto, CONTINUOUS COLLISION DETECTION (CCD) addresses which problPer Glenn Fiedler 'Fix Your Timestep!', the recommended technique for stable physics indepPer Glenn Fiedler 'Integration Basics', the integration scheme used in Jakobsen's CLOTH SIPer Glenn Fiedler 'Integration Basics' (gafferongames.com), SEMI-IMPLICIT EULER (a.k.a. syPer Ericson Ch. 9.5, after GJK detects intersection, EPA (Expanding Polytope Algorithm) is