Discrete Geometry, (Aktuelle Forschungsthemen der Algorithmik) summer semester 2011

Günter Rote, Impressum, KVV
exercise sheets schedule contents literature credit requirements

Exercise Sheets

no.handoutdue date
sheet 112.4.201119.4.2011
sheet 220.4.201126.4.2011
sheet 328.4.20113.5.2011
sheet 46.5.201110.5.2011
sheet 511.5.201117.5.2011
sheet 620.5.201124.5.2011
sheet 73.6.20117.6.2011
sheet 8+98.6.201114.6./21.6.2011
sheet 1021.6.201128.6.2011

Schedule

lecture: Tu 14:00 - 16:00 SR 049, Starting date: April 12
tutorial: Th 16:00 - 18:00 SR 053
office hours: Günter Rote Tu 11:00 - 12:00
Romain Grunert by appointment - room 113 (T9)

Contents

Combinatorial Geometry investigates combinatorial questions about geometric objects. In a set of n points in the plane, how often can a given distance occur between two of these points? If you take the union of n disks in the plane, of how many pieces does the boundary consist? Many of these questions underlie the analysis of geometric algorithms. Some major progress on has been made in the past year; I will report some of these issues.

Selected List of Potential Topics

actual lecture contents

Literature

Credit Requirements

The grade depends only on the examination.


Impressum, 12.4.2011