Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Computational Geometry HS07
Theory of Combinatorial Algorithms Institute for Theoretical Computer Science Department of Computer Science ETH Zurich

Computational Geometry (251-0419-00L) HS07

Time & Place

Lecture: Monday 13:15-15:00, CAB G59
Bernd Gärtner, CAB G32.2, Tel: 044 632 70 26, .
Michael Hoffmann, CAB G33.1, Tel: 044 632 73 90, .
Exercise: Monday 15:00-16:00, CAB G59
Marek Sulovský, CAB G32.1, Tel: 044 632 80 75 .

Course Description

Computational Geometry is about design and analysis of efficient algorithms for geometric problems. These are needed for many applications, e.g. for curve and surface reconstruction on the basis of scanning data, for visualization of large data sets, or for similarity requests in data bases. The lecture addresses basic geometric data structures and introduces important design paradigms for geometric algorithms.

Complementary Courses & Semester/Master/Diploma Theses

This course is complemented by a seminar taking place during this semester ("Seminar zur Algorithmischen Geometrie"). Furthermore, after  having completed the course or the seminar, it is possible to do a semester, master or diploma thesis in the area of Computational Geometry. Students are also welcome at our graduate seminar.

Outlook: During spring semester 2008 the following geometry related courses will be offered:

  • Approximate Methods in Geometry (B. Gärtner, U. Wagner, E. Welzl)
  • Topological Methods in Combinatorics and Geometry (J. Matoušek, U. Wagner)

Exercises

In every lecture we provide you with an exercise sheet. You should solve it in written form and return the solutions at the beginning of the subsequent lecture. Solving the exercises in teams is not allowed.

Your solutions will be graded. If you reach at least 80% of all possible points you will get the grade 6.0, 40% of all possible points correspond to the grade 4.0.

Exam

There will be an oral exam of 15 minutes during the examination period. Your final grade consists to 50% of the grade for the exam and to 50% of the grade for the exercises.

Literature

  • Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, 2000.
  • Franco P. Preparata, Michael I. Shamos, Computational Geometry: An Introduction, Springer, 1985.
  • Bernds Skript for a course held in Berlin in 1996

Course Material


Date Content Slides Exercises Notes Programs

#1 (1.10.2007) Geometry basics, two-dimensional convex hulls PDF PDF, PS PDF [DE only] -

#2 (8.10.2007) Convex hulls PDF,
PDF 4on1
PDF, PS - -

#3 (15.10.2007) Triangulations - PDF, PS - -

#4 (22.10.2007) Trapezoidal decomposition PDF,
PDF 4on1
PDF, PS - -

#5 (29.10.2007) Voronoi diagrams PDF PDF, PS - -

#6 (5.11.2007) Range trees - PDF, PS - -

#7 (12.11.2007) Red-blue intersections PDF PDF, PS - -

#8 (19.11.2007) Line arrangements - PDF, PS PDF -

#9 (26.11.2007) Smallest enclosing balls - PDF, PS - -

#10 (3.12.2007) Line arrangements - PDF, PS PDF -

#11 (10.12.2007) 3-sum - PDF, PS PDF -


Last modified: $Date: 2007/09/07 15:15:21 $ by Marek Sulovský. Valid HTML 4.0! Valid CSS!