VL: Discrete Geometry I (Summer 2025)
This is a BMS Area 5 Core Course.
It is accompanied by a seminar, for those who are interested.
| VL: | Tuesday | 10-12 | BH-N 334 |
| Thursday | 10-12 | BH-N 333 |
Contents
This course is an introduction to polyhedral geometry.
Basic algorithmic concepts in the field are covered, too.
- Polytopes and Polyhedra
- Linear Programming
- Computing Convex Hulls
- Voronoi Diagrams
- Delaunay Triangulations
References
- Joswig and Theobald: Polyhedral and algebraic methods in computational geometry. Springer, 2013.
- Ziegler: Lectures on polytopes. GTM 152. Springer, 1995.