- Instructor: Prof. Dr. Bernd Fröhlich
- Teaching assistants
- Dipl.-Mediensys.wiss. Stephan Beck
- Dipl.-Mediensys.wiss. Andre Schollmeyer
- Lecture schedule
- Tuesdays, 15:15-16:45 (starts October 16, 2012)
- Location: Room 015, Bauhausstr 11
- Lab class schedule
- Date and location will be announced
- Office hours by appointment only
- Target audience
- M.Sc. Medieninformatik/Mediensysteme
- M.Sc. Computer Science and Media
- ECTS Credits
- 4 Credits (Mediensysteme)
- 4.5 Credits (Medieninformatik, Computer Science and Media)
News
- Oral examination dates
- February 4 to February 15 (appointment by email with Prof. Fröhlich)
- March 6 (changed due to travel - appointment with Frau Hansens)
- April 3 (appointment with Frau Hansens)
Course Description
The course focuses on fundamental algorithms and data structures for real-time rendering. The accompanying lab classes allow students to implement and test a set of real-time rendering algorithms and a project of their own choice.
German version
Die Vorlesung befasst sich mit den grundlegenden Datenstrukturen und Algorithmen für das Real-Time Rendering. Regelmäßige Übungen im LiNt-Pool ergänzen die Vorlesung durch praktische Erfahrung bei der Programmierung echtzeitfähiger Grafik.
Diese Vorlesung wird englischsprachig angeboten.
Lecture notes (pdf)
(accessible only from within the university network)
- Introduction (16.10.2012)
- Fundamentals (16.10.2012)
- Convex Hulls (16.10.2012)
- Plane Sweep and Segment Intersections (23.10.2012)
- Point Localization (30.10.2012)
- Point Localization II (6.11.2012)
- Doubly-Connected Edge List (13.11.2012)
- Range Searching (20.11.2012)
- Window Searching (27.11.2012)
- Improvements for Range and Window Searching (4.12.2012)
- Voronoi Diagrams (11.12.2012)
- Delaunay Triangulation (18.12.2012)
- Ray Queries I (15.01.2013)
- Ray Queries II (22.01.2013)
- Ray Queries III (29.01.2013)
Lab classes
- Thursday, 17:00 - 18:30, LiNT-Pool (B11)
- Frist exercise: 01. November
- Collection of exercise 1 (solutions due to 08. November)
- Collection of exercise 2 (solutions due to 22. November)
- Collection of exercise 3 (solutions due to 13. December)
- C++ Framework: simple_gl_framework.tar.gz
- Collection of exercise 4 (solutions due to 17. January)
- Collection of exercise 5 (solutions due to final project presentation)
- C++ Framework: simple_gl_framework.tar.gz
- Final Project Proposals
Final project
- Topics can be selected by yourself or choose one of the proposed topics
- Individual work or group work (max 2 students).
- A short proposal (1-2 pages) that outlines the idea and concept of the final project is recommended.
Grading
- Final exam will be an oral exam covering all topics of the course
- Appointments for oral examination can be made with the computer science secretary (R112, B11)
- Requirements for admittance to the final exam
- In the assignment (exercises 1 to 5) a total amount of 190 points can be achieved.
- In the assignment (exercises 1 to 5) a total amount of 190 points can be achieved.
- The final project is weighted by a factor of 1.5 (= 285 points).
- The following scheme lists the grades depending on the percentage of the achieved points (assignment + final project = 475 points):
- 1.0 >=95.0
- 1.1 [93.5-95.0)
- 1.2 [92.0-93.5)
- 1.3 [90.5-92.0)
- 1.4 [89.0-90.5)
- 1.5 [87.5-89.0)
- 1.6 [86.0-87.5)
- 1.7 [84.5-86.0)
- 1.8 [83.0-84.5)
- 1.9 [81.5-83.0)
- 2.0 [80.0-81.5)
- 2.1 [78.5-80.0)
- 2.2 [77.0-78.5)
- 2.3 [75.5-77.0)
- 2.4 [74.0-75.5)
- 2.5 [72.5-74.0)
- ...
- 3.0 [65.0-66.5)
- ...
- 4.0 [50.0-51.5)
- Less than 50% is insufficient for an admission to the oral exam.
- Contributions to the final grade
- assignments: 20%
- final project: 30%
- final exam: 50%