Gilbert-Johnson-Keerthi (GJK) collision detection algorithm.

This package implements the Gilbert-Johnson-Keerthi (GJK) collision detection algorithm for 2D convex objects. It is quite efficient, usually converging within one or two iterations.

Gilbert-Johnson-Keerthi (GJK) collision detection algorithm

This package implements the Gilbert-Johnson-Keerthi (GJK) collision detection algorithm for 2D convex objects. It is quite efficient, usually converging within one or two iterations.

This project was ported from Elm to Haskell (see zaidan/elm-collision).

Credits

• Firas Zaidan
• Michael Bakkemo

License

See LICENSE file.