Module 5 - Geometric Primitives and Collision - 2026-Jul-14
Overview
In this module we learn about various intersection algorithms.
- Collision Detection Strategies
- Basic Primitive Tests
- minkowski sum/difference
- Equation of a line
- Segment intersection
- SAT - Separating Axis Theorem
Key Resources/Readings
The following resources are listed (roughly) in order to supplement this lecture. You may choose to read 1 or more of these before/during/after the lecture to fully immerse into the material.
- Computational Geometry in C Book (Chapter 7)
- Simple Intersection Tests For Games (Reading)
- Geometric Tests - Useful tests for collision (Reading)
- A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm) (Nice video summarizing what we have learned and introducing GJK)
Slides and Module Content
Please note: Your in-class activity is graded. Your first attempt will be graded. You can use your notes and slides if you like. You have 1 week from the date of this module opening to complete the in-class activity. In-class activities are completed individually.
Note: Audio/Video recordings are made in a best effort in case you have to miss class or you would otherwise like to re-watch a portion of lecture. Occassional recording errors (e.g. missing sound, corrupted video, etc.) may occur, and I apologize in advance if a recording is not able to be made available. That said, it is the expectation that you are coming to class in-person. :)
Audio/Video Recording
Join the Discussions and Make a Post
Please log in to see discussions/posts