Alice_Structure defined by Point + Boundary

Concept

> My intention is to generate a complex pattern by given as few points as possible within a certain area. Later on, this pattern can be interpreted as building structure with a specific relationship or logic. In fact, I have tried out many different logical ways to generate points for iterations in order to set up a particular conditions between the point and its curvatures and hopefully to create a stable and balance structure. Above is only one of the attempts. However, I think it is not successful enough to achieve my goal. The difficulty is that the intersection of the curves is always too localized at a specific area. Modification should be made for clearer logic and waited to be explored 3-dimensionally. 

p.s. Sorry for the belated post. but it's really hard to concentrate in front of the computer when you get to Barcelona!!!!! ;P

Relationship between 2D & 3D ::: alec' in direct from Barcelona ;-)

Assignement 01A ::: Relationship between 3D and 2D.

The principle of this recursion is simple. It is a question of interpreting in 2D, a 3D operation! So, the forms do not change topologicaly), it's the point of view of each element which change!

In these examples, I used a simple rotation of every element, successively from 0, 15, 30, 45, 60, 75 and 90 ° on three axes of rotation, x, y and z! I also used a vertical movement for more visibility, but the plan remains unchanged.

Assignment 01 - Andreea

Assignment 01

assignment 01A

Fibonacci number spiral

Assignment 01

Recursive subdivision

Each first time the function divides a rectangle/square in 1/3 and each second time in 2/3

One of the possibilities could be to either extract according to this diagram parts from a cube or add parts to a surface.

Alexander & Tudor

Assignment 01A

Calendar

I created a Google Calendar for the course.

As you can see, for the next two Mondays we won't have any classes. But that will mean that when everybody is back we will have extra Scripting classes, at least in the first 1 or 2 weeks.

You can check the calendar on this blog's sidebar, or go to the calendar address to see it in its entirety.

Assignment 01A

As discussed in last class, you are supposed to deliver a small set of diagrams (like the ones from the post below), showing an idea of a recursive algorithm using basic 2D geometric shapes (square, circle, triangle, straight line, pentagon etc).

You should define a simple rule and show in a diagram how the iteration of this rule is going to create complexity. Also, define initial state and final condition.

The results should be posted here on the blog by Saturday, 25.04, so that I can take a look at it on Sunday and choose some to further develop in class.

The goal of this first assignment is to create the basic graphical idea to be further explored and developed into a pavilion-like structure.

Recursion

Our first topic this semester is recursion. Here are some randomly collected notes about recursion:

• Recursion is a way of thinking about and solving problems
• one of the central ideas of computer science
• Solving a problem using recursion means that the solution depends on solutions to smaller instances of the same problem
• Function called in itself
• Loops (for, while) are a way of creating recursive functions without the advent of calling the function inside itself
• A common method of simplification is to divide a problem into sub-problems of the same type. For example:
  • How do you move a stack of 100 boxes?
  • Answer: you move one box, remember where you put it, and then solve the smaller problem: how do you move a stack of 99 boxes?
  • Eventually, you're left with the problem of how to move a single box
• Here is another, perhaps simpler way to understand recursive processes:
  • Are we done yet?
  • If so, return the results. Without such a termination condition a recursion would go on forever.
  • If not, simplify the problem, solve the simpler problem(s), and assemble the results into a solution for the original problem.
  • Then return that solution

Source, among others: en.wikipedia.org/wiki/Recursion_(computer_science)

The concept of recursion can be easily observed in the case of the Serpentine Pavilion. You start with a simple rule of connecting the middle of one size of the square with the first third of the adjacent side:

So instead of following a 1/2 to 1/2 rule, which would create a simple square spiraling inside itself, the algorithm follow a 1/2 to 1/3 rule, which creates a spiraling square with intersects with itself. This slight change in the rule ends up increasing the complexity of the final result and creates more support points for the structure of the building.

The 1/2 to 1/3 rule is iterated only 7 times. By the dimensions of the pavilion (17x17m), this is enough to end up with efficient beam vs. holes sizes:

As the final step, all lines from all squares are extended. Then the borders are "folded" down to form the box, so that the pattern/structure continues until the floor.

The final result is beautiful, complex, and most important, extremely efficient structure-wise and construction-wise.

Week 1 - recap

Last Monday we had our first class, where I introduced the first part of the course. In the next days, we'll be working on the concept of recursion, creating complexity out of very simple rules.

The basis for this idea can be found in the Serpentine Pavillion 2002, by Toyo Ito in collaboration with Cecil Balmond. As I showed in class, this impressive piece of architecture creates a whole new language of complexity and holistic design which parts from a simple recursive rule.

We also started to create some fairly simple recursive functions, as well as an approach to the recursive squares as used at the Serpentine Pavillion.

As a result of this first week, you are required to deliver a small assignment, as detailed in the next blog post.

Script editors

Another list, this time with Script Editors. It is highly recommended that you use a script editor to write your scripts.

Resources

Here is a list with several resources to aid you in the scripting learning process. Make good use of it!

Setting up

As a first step, all students should perform the instructions contained in the setting up document from the former Dia Scripting wiki.

Click here to go to the document directly.

Generative Scripting II - SS09

Today we start our Generative Scripting II course for the Summer Semester 09.

From the syllabus:

Starting with the premise that the student already has basic familiarity with scripting, this course will go one step further and look closely at the relationship of scripting and architecture.

As in the course Generative Scripting I, it will be divided in parts. In each part, we will start with the analysis of one contemporary existing building which experiments with geometric algorithms
to structure and organize its space. By studying, understanding and extracting the basic principles of these algorithms, we will develop our own variants.

Each group of two students will be required to deliver a small assignment by the end of
each part. The sum of these assignments will compose the final course grade.

The classes will take place every Monday 14:30, at the Marmorsaal in Building 01.