Computational Geometry

Vorlesung: Dienstag, 15:00 - 16:30 , PK 2.2
Übung: Montag, 16:45 - 18:15 , IZ 305
kleine Übung: Mittwoch, 16:45 - 18:15 , IZ305

After the course, the participants know the basic models of geometric algorithms. They are able to identify algorithmic difficulites of geometric problems and are able to formulate adequate objectives. They can handle different solution techniques and are able to develop algorithmic methods for yet unknown problems. They survey the practical relevance of problems and solutions.

We will speak English in class. Students are encouraged (but not required) to use English in exercises and exams as well.

1. Geometric Problems and Data Structures
2. Triangulation
3. Localization
4. Voronoi Diagrams
5. Convex Hulls
6. Motion planning for robots

• Mark de Berg, Marc van Kreveld, Mark Overmars and Otfried Schwarzkopf: Computational Geometry: Algorithms and Applications, Second. Aufl., Seite 367, Springer-Verlag, 2000 (deBerg2000, BibTeX)
• Rolf Klein: Algorithmische Geometrie, Seite 1-355, examen.press, 1997 (Klein1997, BibTeX)

Announcements and Dates

• The oral exams will take place on Monday, 26.3., and Tuesday, 27.3.. The detailed (and updated) exam schedule has been distributed via the mailing list on February 10th, in case you did not receive this mail (or have another problem) please send an email to Christiane!
• Homework set #5 is online: [PDF]
• Homework set #4 is online: [PDF]
• Homework set #3 is online: [PDF]
• The third homework set (#2 that is ;)) is online: [PDF]
• The second homework set (#1 that is ;)) is online: [PDF]
• Attention: the first tutorial ist postponed to November 14 (not November 7)!!
• The first homework set is online: [PDF]

General Information

• Schedule of all lectures, tutorials etc.: [PDF]
• There is a mailinglist. We will distribute the homework sets and other announcements via this list, so, please subscribe!