Lecture 11: A Full Graphics Pipeline (slides)

Slides: [ slides ] [ slides with annotations ]

Exercises: Tutorial 9, problems 1-3 (Clipping) [ exercises ]

Recommended reading: Chapter 12 in the textbook. The Sutherland-Hodgman and the Weiler-Atherton algorithm are not covered in the book, but the lecture notes should be sufficient to understand them.