https://github.com/emmanuelmess/gjkdistancealgorithm

Gilbert–Johnson–Keerthi distance algorithm
https://github.com/emmanuelmess/gjkdistancealgorithm

Last synced: 10 months ago
JSON representation

Gilbert–Johnson–Keerthi distance algorithm

• Host: GitHub
• URL: https://github.com/emmanuelmess/gjkdistancealgorithm
• Owner: EmmanuelMess
• Created: 2021-03-25T19:27:23.000Z (about 5 years ago)
• Default Branch: master
• Last Pushed: 2021-03-26T01:46:39.000Z (about 5 years ago)
• Last Synced: 2025-03-05T09:20:34.674Z (about 1 year ago)
• Language: C
• Size: 15.6 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Gilbert–Johnson–Keerthi distance algorithm

Detects intersection between two convex shapes.

[![Chat on Telegram](https://img.shields.io/badge/Chat%20on-Telegram-brightgreen.svg)](https://t.me/EmmanuelsApps)

Given a function that returns the point in the shape

which maximizes the scalar product with a direction d, and

a centroid of the shape for each shape, I return if any two intersect.

Credit:

* [A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)](https://www.youtube.com/watch?v=ajv46BSqcK4)

----