| What | When | Where | Start | ECTS | Lecturer and Tutor |
|---|---|---|---|---|---|
| Lecture | Monday 14:15 - 15:45 | Hörsaal 7 | 12 October 2025 | 5,5 | Prof. Dr. Anne Driemel |
| Wednesday 10:15 - 11:45 | Hörsaal 3 | ||||
| Tutorials | TBD | 2.050 | 14 October 2025 | 3,5 | Marena Richter |
| TBD | 2.050 |
This is a 9 ECTS (270 h) course targeted at master-level Computer Science and Mathematics students. There will be two lectures each week. These are accompanied by weekly problem sets that students are expected to solve in independent self-study. The solutions to the problem sets are discussed in the tutorial sessions. Each student is expected to participate actively in these.
Course materials and up-to-date information on course organisation will also be provided on eCampus.
Computational Geometry is the study of algorithmic problems for geometric data. Thereby it touches upon a wide spectrum of application areas including computer graphics, geographic information systems, robotics, and others. The study of geometric algorithms is a classical part of theoretical computer science, but often also involves the combinatorial analysis of the complexity of geometric configurations. This has fundamental connections to Discrete Geometry which we will also study in this course.
Topics which will be treated in this course include:
Students have to hand in their written solutions for weekly problem sets (groups of up to two students each). At least 50% of the overall points have to be reached in order to be admitted to the final exam. There will be oral exams at the end of the semester.
The basis of the course work are the lectures and assignments. Lecture notes for all lectures will be available on eCampus. For further reading we recommend the following books: