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. The exercise (UE) and tutorial (Tut) sessions will be given by Lena Weis.

VL: Tuesday 10-12 BH-N 334
Thursday 12-14 BH-N 243
UE: Tuesday 14-16 MA 650
Tut: Wednesday 10-12 MA 850

Attention: TU's central administration decided to move the course (in time and space) on short notice [7 April 2025], as indicated above!

Contents

This course is an introduction to polyhedral geometry. Basic algorithmic concepts in the field are covered, too.

  1. Convexity
  2. Polytopes and Polyhedra
  3. Linear Programming
  4. Computing Convex Hulls
  5. Voronoi Diagrams
  6. Delaunay Triangulations

References

  1. Joswig: Convex polytopes and linear programs. Snapshots of modern mathematics from Oberwolfach, no.2, 2025.
  2. Joswig and Theobald: Polyhedral and algebraic methods in computational geometry. Springer, 2013.
  3. Ziegler: Lectures on polytopes. GTM 152. Springer, 1995.

Code examples

  1. Tuesday, 20 May 2025: OSCAR, polymake
Home Teaching Presentations Projects Software

Last modified: Wed May 21 13:14:32 UTC 2025 by joswig