Seminar: Geometric Optimization Problems

Lecturers

Ulf Friedrich, Marinus Gottschau

Brief Description

The seminar focuses on algorithmic geometry at an introductory level. Topics include algorithms for computing, e.g., triangulations, Voronoi cells, and convex hulls. In addition to the theoretical foundations we will also discuss applications from fields such as computer graphics and robotics.

The presentations will take place in English. More information will be provided during the kick-off meeting.

Times & Dates

• Thu. October, 17th 2019 at 14:00-16:00: Kick-off meeting
• Thu. October, 30th 2019 at 14:00-16:00: Elevator pitches
• Thu. December, 12th 2019 at 14:00-18:00: 
  • Computation of Convex Hulls
  • Voronoi Diagrams
• Thu. December, 19th 2019 at 14:00-18:00:
  • Delone Triangulations
  • Non-linear Computational Geometry

All meetings take place in 02.06.020.

Prerequisites

Necessary: Algorithmic Discrete Mathematics (MA2501)

Recommended: Fundamentals of Convex Optimization (MA2504)

Literature

de Berg M., van Kreveld M., Overmars M., Schwarzkopf O.C. (2000) Computational Geometry. Springer https://link.springer.com/chapter/10.1007/978-3-662-04245-8_1

 Joswig M., Theobald T. (2013) Polyhedral and Algebraic Methods in Computational Geometry. Springer https://link.springer.com/book/10.1007%2F978-1-4471-4817-3