To utilize algorithmic methods in design and architecture a different way of thinking is needed. Not the product but the formulation of rules and the definition of parameters is the aim. Complexity is not the aim, but the result.

To classic elements of architecture are insufficient, new forms and data structures to represent and describe architecture are needed.

Building on your previous knowledge in CAAD and (3D-) geometry the course will teach basic principles of graph theory, vector math and sets as well as practical functional planning concepts, using data from competitions as reference. The lecture is thus to be understood as basis for the later implementation of solutions in the relevant programming platforms.

You can attend the lecture with or without the whole module. We are convinced that the subjects being offered will benefit everyone who¿s task is dealing with planning using algorithmically methods.

Based on practical examples from competitions, we will bring the underlying concepts and structures that can be used to generate solutions programmatically, e.g.:

• graph theory
• algorithms and data structures (lists, sorting, trees, ...)
• 3D vector calculus
• design methods for algorithmic problem solving (e.g. Activity Data Method)

see link

CAAD tools, vector calculus.