#

convex-set

Here is 1 public repository matching this topic...

WillKirkmanM / gilbert-johnson-keerthi

The Gilbert-Johnson-Keerthi (GJK) Algorithm is a Highly Efficient Method for Determining the Minimum Distance Between Two Convex Sets (Shapes)

gilbert-johnson-keerthi parsonlabs convex-set

Updated Dec 22, 2025
Rust

Improve this page

Add a description, image, and links to the convex-set topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the convex-set topic, visit your repo's landing page and select "manage topics."