TU BRAUNSCHWEIG
| Carl-Friedrich-Gauß-Faculty | Computer Science
Informatikzentrum

Geometric Algorithms for Folding and Unfolding

Module #INF-ALG-20
Event #INF-ALG-030
ProgrammesMaster Informatik, Master Informations-Systemtechnik, Master Wirtschaftsinformatik
IBR Group(s)ALG (Prof. Fekete)
TypeVorlesung/Übung
Lecturer
PhotoDr. Iris Reinbacher
Ehemalige Wissenschaftliche Mitarbeiterin
Credits5
Hours2+1
Time & PlaceIZ 305
Mondays, 9:45 - 11:15
Thursdays, 11:30 - 12:15
Start18. October 2012
PrerequisitesYou 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.
LanguageEnglish
Certificates50 % of points on midterm exam.
presenting 2 homework exercises in class
Written exam at the end of the semester
ContentFolding 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
printemailtop