Prof. Rhadamés Carmona, PhD
The goal of this course is to provide students with the theoretical and applied foundations for the design and analysis of efficient algorithms for problems involving geometric input and output. The course focuses on real-time problems in 2D- and 3D-graphics and visualization applications.
Through this course students learn to select, adapt and implement basic and advanced algorithms and data structures to solve concrete problems. Furthermore, they should be able to analyse the complexity of algorithms and data structures.
The accompanying lab classes provide students with the necessary skills to implement and test selected algorithms.
News
- Written exam: February 20th, 10am - 12am, Audimax, Steubenstraße 6
Enrollment: Sign up for the written exam through Bison.
Course Organization
Instructors
Prof. Dr. Rhadamés Carmona
Lecture Schedule
Wednesdays, 11:00 AM - 12:30 PM at Room 015, Bauhausstr. 11
Starts on October 16, 2019
Lab Class Schedule
Group A: Mondays, 9:15 AM - 10:45 AM at LiNT-Pool, Bauhausstr. 11
Group B: Tuesdays, 9:15 AM - 10:45 AM at LiNT-Pool, Bauhausstr. 11
Starts October 28 / 29, 2019
Target Audience
B.Sc. Medieninformatik (Wahlmodul)
M.Sc. Computer Science for Digital Media (Graphical and Interactive Systems, Electives)
M.Sc. Computer Science and Media (Interactive Information Systems, Electives)
M.Sc. Human-Computer Interaction (Electives)
M.Sc. Digital Engineering (Visualization and Data Science (VaDS), Electives)
ECTS
Lecture and Lab Class: 4.5 ECTS
Lecture, Lab Class and Final Project: 6 ECTS
Lecture Materials
The files are only accessible within the university network using a password provided during the first lecture. Adobe Acrobat Reader works well with protected files. Please do not redistribute the materials.
| Date | Topic | Download |
|---|---|---|
| 16 October 2019 | Introduction | |
| 16 October 2019 | Fundamentals | |
| 6 November 2019 | Convex Hulls | |
| 13 November 2019 | Sweep | |
| 20 November 2019 | Point Localization | |
| 27 November 2019 | DCEL | |
| 4 December 2019 | Range Search | |
| 18 December 2019 | Windows Search | |
| 08 January 2020 | Voronoi | |
| 15 January 2020 | Delaunay | |
| 22 January 2020 | BSP | |
| 29 January 2020 | Quad-Tree |
Lab Class Materials
The files are only accessible within the university network. Please do not redistribute the materials.
Please enroll to the lab class on moodle and submit your solutions there.
The enrollment key will be announced in the lecture.
| Date | Topic | Download |
|---|---|---|
| 28 October 2019 | Exercise 1 | |
| 11 November 2019 | Exercise 2 | |
| 1 December 2019 | Exercise 3 | |
| 6 January 2020 | Exercise 4 | |
| 20 January 2020 | Exercise 5 |
Grading
The final exam will be a written exam covering all topics of the course.
Requirements for admittance to the written exam:
- 50% of the total amount of points in the lab assigments (exercises) have to be obtained.
Requirements for final grading:
- 50% of the total amount of points in the lab assignments have to be obtained.
- 50% of the total amount of points of the written exam have to be obtained.
The final grading will be weighted as follows:
- Assignments: 50%
- Written exam: 50%
The following scheme is applied to convert percentages to grades:
| Grade | Percentage |
|---|---|
| 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) |
| 5.0 (fail) | [00.0 - 50.0) |
Final Project (optional)
The final project of the course Real-time Rendering (graded separately and awarded additional 1.5 ECTS) requires the participants to apply the obtained theoretical and practical skills of the course “Real-time Rendering” in the design, implementation and presentation of an individual small research project. In particular, it is your task to select a problem, develop a solution, come up with an effective and efficient implementation and present your results in a concise talk. This is an invaluable opportunity to work on an interesting topic of your choice in the field of geometric algorithms.