VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

252-1425-00L 8 Credits BSC , MSC , WBZ D-INFK , D-MATH

Geometry: Combinatorics and Algorithms

Lecturers & Examiners: Prof. em. Dr. Emo Welzl, Prof. Dr. Bernd Gärtner, Dr. Michael Hoffmann, Prof. Dr. Karl Bringmann, Dr. Manuel Wettstein, Dr. Patrick Schnider
VVZ CR 4.2

Last Updated: 2026-06-03 00:07:33

Abstract

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?)

Objective

The goal is to make students familiar with fundamental concepts, techniques and results in combinatorial and computational geometry, so as to enable them to model, analyze, and solve theoretical and practical problems in the area and in various application domains. In particular, we want to prepare students for conducting independent research, for instance, within the scope of a thesis project.

Content

Planar and geometric graphs, embeddings and their representation (Whitney's Theorem, canonical orderings, DCEL), polygon triangulations and the art gallery theorem, convexity in R^d, planar convex hull algorithms (Jarvis Wrap, Graham Scan, Chan's Algorithm), point set triangulations, Delaunay triangulations (Lawson flips, lifting map, randomized incremental construction), Voronoi diagrams, the Crossing Lemma and incidence bounds, line arrangements (duality, Zone Theorem, ham-sandwich cuts), 3-SUM hardness, counting planar triangulations.

Resources

Lecture Notes

yes

Literature

Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Cheong, Computational Geometry: Algorithms and Applications, Springer, 3rd ed., 2008. Satyan Devadoss, Joseph O'Rourke, Discrete and Computational Geometry, Princeton University Press, 2011. Stefan Felsner, Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, Teubner, 2004. Jiri Matousek, Lectures on Discrete Geometry, Springer, 2002. Takao Nishizeki, Md. Saidur Rahman, Planar Graph Drawing, World Scientific, 2004.

General Information

Language
English
Levels
BSC , MSC , WBZ
Frequency
Yearly recurring

Examination

Type
session examination
Mode
oral 30 minutes
60% final oral exam: 30 minutes oral exam with 30 minutes preparation time (no material allowed) plus two graded homework (20% each). The two mandatory graded homework (compulsory continuous performance assessments) will be released throughout the semester, at specific dates that will be announced. Each graded homework will have a deadline two weeks after the release.The solutions must be typeset in LaTeX (or similar).

Course Components

Type Title Time & Place Hours
lecture Geometry: Combinatorics and Algorithms No time listed 3 h weekly
exercise Geometry: Combinatorics and Algorithms No time listed 2 h weekly
independent project Geometry: Combinatorics and Algorithms
Project Work, no fixed presence required.
No time listed 2 h weekly

Offered In