|Website:||website containing additional information|
|Period:||period 2 (week 46 through 5, i.e., 9-11-2020 through 5-2-2021; retake week 16)|
|Participants:||up till now 35 subscriptions|
|Schedule:||Official schedule representation can be found in MyTimetable|
|Note:||No up-to-date course description available.|
Text below is from year 2018/2019
|Contents:||ADVANCED GRAPHICS 2018/2019.|
The master course Advanced Graphics addresses advanced topics in 3D computer graphics. The focus of the course is physically-based rendering of 3D scenes. The course has two main focus areas: rendering algorithms and making rendering more efficient. Efficiency will be sought through acceleration structure construction and traversal and variance reduction.
The course starts with a recap of Whitted-style ray tracing. We then explore various acceleration structures that help to run the ray tracing algorithm in real-time on commodity hardware. We will see that a well-built bounding volume hierarchy provides both flexibility and speed, for static and dynamic scenes.
The second part of the course introduces the path tracing algorithm, and related light transport theory. We investigate various methods to improve the efficiency of the algorithm using probability theory. We will see that efficient path tracing can yield interactive frame rates.
In the third part of the course we use GPGPU to run ray tracing and path tracing on the GPU. We will explore recent research in high performance stochastic rendering.
The course does not strictly follow a fixed textbook. During the course, a number of papers will be used. These will be specified in the lectures.
|Course form:||The course consists of a lecture, practical projects and an exam.|
|Exam form:||In order to pass the course, you must meet these requirements:|
Practical grade P = (P1 + P2 + 2 * P3) / 4
Exam grade E
Final grade F = (2 * P + E) / 3
P >= 4.5
E >= 4.5
F >= 5.5.
|Minimum effort to qualify for 2nd chance exam:||To qualify for the retake exam, the grade of the original must be at least 4.|