Computational Geometry

Lecturer: Thomas Bläsius

Teaching Assistants: Jean-Pierre von der Heydt, Marcus Wilhelm, Wendy Yi

Spatial data is processed in a wide variety of areas in computer science, such as computer graphics and visualization, geographic information systems, robotics, and more. Computational geometry focuses on the design and analysis of geometric algorithms and data structures. This module introduces frequently used techniques and concepts in computational geometry, which are explored in depth using selected and application-related questions.

See here for more info.

We meet every week on Mondays at 3:45 PM and Thursdays at 3:45 PM in room 131. The first lecture will take place on Thursday, April 24th, at 3:45 PM.

1. Convex Hull: with clicks, without clicks
2. Line Segment Intersection: with clicks, without clicks
3. Polygon Triangulation: with clicks, without clicks
4. Linear Programs & Half-Plane Intersection: with clicks, without clicks
5. Range Trees: with clicks, without clicks
6. Fractional Cascading: with clicks, without clicks

• Exercise 1, ex1_discon_geomgraph.pdf
• Exercise 2

• Sheet 1
• Sheet 2

• Duality: Slides