Content deleted Content added
ClueBot NG (talk | contribs) m Reverting possible vandalism by 88.178.143.121 to version by 2.109.190.136. False positive? Report it. Thanks, ClueBot NG. (2239631) (Bot) |
Tiepczdkrokgfebfg Vddhfjfgdgbvdcgfggfg guffffih Tags: Mobile edit Mobile web edit |
||
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
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]].
| |||