Module 3 - Convex Hulls - 2026-Jul-07
Overview
In this module we learn about the Convex Hull
- Polygon Partitioning
- Plane Sweep
- Convex Hulls in 2D
- Gift Wrapping
- Quick Hull
- Closest point to line segment
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 2 and 3)
- Phil Kinderman's Convex Hull Series (Video Series)
- Physics for Game Programmers: QuickHull (Talk on Quick Hull at Game Developers Conference (Also introduces Half-edge))
- Library for quickhull (web resource)
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