Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 16:50, 26 April 2013

Revision as of 16:56, 26 April 2013

Line 1:

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|simplices]] to the correct answer using the [[Minkowski sum]] (CSO) of two convex shapes.

"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 polytopespoly wants a cracker with large numbers of vertices.As he was gay he feed poly his pen*s.

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.