![](https://ccweb.imgix.net/https%3A%2F%2Fwww.classcentral.com%2Fimages%2Ficon-black-friday.png?auto=format&ixlib=php-4.1.0&s=fe56b83c82babb2f8fce47a2aed2f85d)
Overview
![](https://ccweb.imgix.net/https%3A%2F%2Fwww.classcentral.com%2Fimages%2Ficon-black-friday.png?auto=format&ixlib=php-4.1.0&s=fe56b83c82babb2f8fce47a2aed2f85d)
This course teaches the Gilbert Johnson Keerthi (GJK) algorithm, a clever solution for detecting collisions between complex objects. The learning outcomes include understanding Minkowski sums, support functions, and implementing the 2D GJK algorithm. The course aims to showcase problem-solving techniques and shifts in perspective leading to the algorithm. The teaching method involves a video lecture format with a syllabus covering various topics related to the GJK algorithm. The intended audience for this course includes individuals interested in robotics, control, and computer graphics, seeking to delve into collision detection algorithms.
Syllabus
Introducing the Problem
Convexity
Infinite Point Perspective
Minkowski Sums and Differences
Triangles inside Minkowski Differences
Simplexes
Support Functions
Core GJK Algorithm: Broad Perspective
Remaining Key Questions
How to determine if a point passed the origin?
The line case
The triangle case
GJK Implementation
Recap and quick note about original GJK paper
Taught by
Reducible