After successful completion of the course, students are able to use algorithms and data structures to generate geometry in line with the design process.

The student is able to implement the algorithms and data structures discussed during the course in a programming language.

Furthermore, the student is able to recognize the advantages and disadvantages as well as the runtime behavior of algorithms.

During the course, various algorithms and data structures for the design (concept and draft) of complex buildings (e.g. hospitals, airports, train stations) are presented; e.g. Bin Packing, genetic algorithms, kd-Trees and other partitioning of space, Box Counting, Viewshed Analysis and graph-based functional analysis for analysis during the solution selection.

The course is held as a seminar, with the state-of-the-art in algorithms and data structures for planning being worked out together. This status is then applied to current planings, taken from the competition results of the "Kammer der Architekten und Ingenieurkonsulenten" (www.architekturwettbewerb.at).

Presentations on selected topics and discussion about algorithms and data structures

There is no script for the course; the algorithms and data structures have to be queried in the corresponding books in the library as well as via literature research portals (www.cumincad.org, ACM SigGraph).

Attendance, elaboration of the seminar topics