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 lec
Podcast
Podcaster
Computer graphics lecture given by Wolfgang Hürst at Utrecht University in 2007/2008, period 2.
Beschreibung
vor 16 Jahren
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.
[ 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.
Weitere Episoden
vor 16 Jahren
vor 16 Jahren
vor 16 Jahren
vor 16 Jahren
Kommentare (0)