GJK for C#
This project is a 3D implementation of the Gilbert-Johnson-Keerthi distance algorithim, for use in Continuous Collision Detection physics simulations. It contains a simple gift wrapping algorithim for determining convex hulls, and can calculate the distance between two 3D objects, as well as calculate the shortest depenetration vector for resolving any overlaps. The interactive demo allows you to move a cube around in 3D space, rendering the Minkowski difference of the two closest shapes, as well as the generated simplex.
You can check out the presentation that I wrote (linked below), explaining the basic principles of the algorithim, and some solutions to more practical problems one might experience when implementing the algorithim, especially given its reliance on floating-point math.
