Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 13:55, 27 July 2022

Revision as of 06:54, 6 December 2022

Line 4:

"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 makes use of Johnson's distance subalgorithmsub algorithm, which computes in the general case the point of a tetrahedron closest to the origin, but is known to suffer from numerical robustness problems. In 2017 Montanari, Petrinic, and Barbieri proposed a new subalgorithmsub algorithm based on signed volumes which avoidsavoid the multiplication of potentially small quantities and achieved a speedup of 15% to 30%.

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 algorithm 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 realtimeRealtime [[collision detection]], especially in [[physics engine]]s for [[video games]].

== Overview ==