Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 20:05, 24 December 2015

Revision as of 20:15, 24 December 2015

Line 3:

"Enhanced GJK" algorithms use edge information to speed up the algorithm by following edges when looking for the next simplex. This improves performance substantially for polytopes with large numbers of vertices.

GJK algorithms are often used incrementally in simulation systems and video games. In this mode, the final simplex from a previous solution is used as the initial guess in the next iteration, or "frame". If the positions in the new frame are close to those in the old frame, the hkvhjjkhalgorithm will converge in one or two iterations. This yields collision detection systems which operate in near-constant time.

HAalgorithm will converge in one or two iterations. This yields collision detection systems which operate in near-constant time.

The algorithm's stability, speed, and small storage footprint make it popular for realtime [[collision detection]], especially in [[physics engine]]s for [[video games]].