Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
-
Updated
Apr 20, 2024 - C++
Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
C# implementation of GJK and EPA algorithms for 3D collision detection, intersection point and output vector calculation. Fast and stable, with minimal external references.
Very simple and small Rockfall 3D engine based on OpenTK library to demonstrate how GJKEPA library works. Written in pure C#, with minimum external references.
Go module closest provides you calculating the closest points of two convex hulls.
Add a description, image, and links to the epa-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the epa-algorithm topic, visit your repo's landing page and select "manage topics."