| Carl-Friedrich-Gauß-Faculty | Computer Science

Geometric Algorithms for Folding and Unfolding

Semester Winter 2012/2013 [ Other terms: · Winter 11/12 ]
Module # INF-ALG-20
Event # INF-ALG-030
Programmes Master Informatik, Master Informations-Systemtechnik, Master Wirtschaftsinformatik
IBR Group(s) ALG (Prof. Fekete)
Type Vorlesung/Übung
Photo Dr. Iris Reinbacher
Ehemalige Wissenschaftliche Mitarbeiterin
Credits 5
Hours 2+1
Time & Place IZ 305
Mondays, 9:45 - 11:15
Thursdays, 11:30 - 12:15
Start 18. October 2012
Prerequisites You should be familiar with algorithms, data structures, (computational) geometry, discrete mathematics. Knowledge of complexity theory or graph theory may be useful.
We will speak English in class.
Language English
Certificates 50 % of points on midterm exam.
presenting 2 homework exercises in class
Written exam at the end of the semester
Content Folding 1 and 2D structures in 1, 2, and 3 dimensions: "Linkages" "Origami" "Polyhedra"
References "Geometric Folding Algorithms: Linkages, Origami, Polyhedra"
by Erik D. Demaine and Joseph O'Rourke
Cambridge University Press, 2007

Recent research papers as required.

Further Information

NEW: (January 24th, 2013) Exercise Sheet Additionally for the last exercise: Patches the Cat

last changed 2013-01-24, 11:19 by Dr. Iris Reinbacher