Students learn how to solve algorithmic problems given by a textual description (understanding problem setting, finding appropriate modeling, choosing suitable algorithms, and implementing them). Knowledge of basic algorithms and data structures is assumed; more advanced material and usage of standard libraries for combinatorial algorithms are introduced in tutorials.

This course covers the classic material of computational geometry,concerned with the design and analysis of algorithms and datastructures for geometric problems in low dimensions (mostly twoand three).

Geometric structures are useful in many areas, and there is a need to understand their structural properties, and to work with them algorithmically. The lecture addresses theoretical foundations concerning geometric structures. Central objects of interest are triangulations. We study combinatorial (Does a certain object exist?) and algorithmic questions (Can we find a certain object efficiently?)

This seminar complements the course Geometry: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent.

Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.

Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.

In this seminar, the students present original research papers on low-and highdimensional computational geometry, most of them very recent.Admission criterion is the former participation inthe course``Algorithmische Geometrie'' .

In this seminar, the students present original research papers on low-and highdimensional computational geometry, most of them very recent.Admission criterion is the former participation in the course``Algorithmische Geometrie'''.