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

Geometric Algorithms for Folding and Unfolding

Semester Winter 2011/2012 [ Other terms: Winter 12/13 ]
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
Lecturer
Photo Dr. Iris Reinbacher
Ehemalige Wissenschaftliche Mitarbeiterin
Credits 5
Hours 2+1
Time & Place IZ 161
Lectures and Exercises will be blocked in September and October as follows:
Lectures: 14., 15., 16., 19., 20., 21. September 2011,
09:45 - 11:15 h and 13:15 - 14:45 h
Exercises: 19., 20., 21. October 2011,
also 09:45 - 11:15 h and 13:15 - 14:45 h
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 small exam.
An individual project, to be completed in the period between lecture and exercises, and to be presented to all participants during the exercise week.
Content

...

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

Further information can be found here.


last changed 2011-08-29, 14:13 by <>
printemailtop