Results: The data that you are viewing.
Inside Air temperature Average : is the average of the inside Air temeperature in the hottest and coldest day in Barcelona, this number should be the same all the time. 21 C degrees/hr.

Cooling Average : This is the jules/hourly that you have to spend in this building to keep the temperature at 21 C degrees. during the hottest and coldest day in the year. (this number must be change)

Heatting Average : This is the jules/hourly that you have to spend in this building to keep the temperature at 21 C degrees. during the hottest and coldest day in the year. (this number must be change)

The settings of the buildings, like the type of glass in windows, the material of walls or even the weather are defined in the E+ file.

The complex thing in a GA is not the programming part, as you can think, Is the way of how you define the problem that you want to optimize. This is usually a function called Fitness Function (FF). The correct set of your FF will determine the increase of the population’s level in each iteration. Therfore the effort must be put here.

The FF allows to evaluate each solution (individual) and to set who is who in the population, or in a different way, which of these solutions are the best and which are not.

Sometimes you can work with a really simple FF, like evaluating the length of a path, that you want to reduce. Besides, it can consists os a series of different equations that each individual must test. Logically, this process involve computational resources, it take some seconds or even minutes to achieve a correct evaluation.

In the case of one of my experiments, the evaluation consisted of determine how much energy a building spends in a specific weather. To achieve that I had to write a series of classes in C# (some of classes are built embedded in GC). Well a whole programme (with out interface, Console application) to allow me to transform the complete geometry in a different type of file for its thermal analysis in EnergyPlus.

This Video shows one of my first experiments in which I connect automatically (send and retrieve the data) GC and E+.

Some Images from the complete generation, saving every “child”:

And here the code:
some functions from Marius Watz:
Option Explicit
‘Script written by carlos de la b.
‘Script copyrighted by designemergente.org
‘Script version miércoles, 24 de junio de 2009 18:17:12

Call Main()
Sub Main()

‘//we need a Surface to grow and grow
Dim Idsrf
Idsrf = Rhino.GetObject(”sel srf”,
If IsNull(Idsrf) Then Exit Sub

Call rec(Idsrf, 0)

End Sub

Function rec(Idsrf, counter) ‘//recursion under your own Risk!!!

‘domain of the curve
Dim Udom, Vdom
Udom = Rhino.SurfaceDomain(Idsrf, 0)
Vdom = Rhino.SurfaceDomain(Idsrf, 1)

‘parameters, divisions, counters and a point
Dim Up, Vp, divU, divV, i, j, k, pt, l
k = 0
divU = 6
divV = 6

Dim arrPoints(35)

For i = 0 To divU – 1
For j = 0 To divV – 1

Up = Udom(0) + i * ((Udom(1) – Udom(0)) / divU)
Vp = Vdom(0) + j * ((Vdom(1) – Vdom(0)) / divV)

pt = Rhino.SurfaceCurvature(Idsrf, Array(Up, Vp))

‘Randomize
‘ If 0.5 < rnd Then
‘ pt(1) = Rhino.VectorScale(pt(1), rnd * 5)
‘ l = Rhino.PointAdd(pt(1), pt(0))

‘ Else
l = Rhino.PointAdd(pt(1), pt(0))

‘ End If

arrPoints(k) = l
k = k + 1

Next
Next

Call Rhino.DeleteObject(IDsrf)
Dim n: n = Rhino.AddSrfPtGrid (Array(divU, divV), arrPoints)

Call Rhino.sleep(3000)

renderView()

Call rec(n, counter + 1)

End Function

‘ Render current viewport
Function renderView()’this function from Marius Watz, a very little modification by me.
Dim view,filename

view = Rhino.CurrentView
Rhino.Command “_-Render”
filename=getRenderFileName(”GrowSurface”)
Dim cmd : cmd=”_-SaveRenderWindowAs ” & Chr(34) & filename & Chr(34)
Rhino.Command cmd
Rhino.Command “_-CloseRenderWindow”
Rhino.Sleep(3000)
End Function

‘ Get auto-incremented filename
Function getRenderFileName(scriptName) ‘this function from Marius Watz
Dim index,done, doc, file, temp,imgNum

done=-1
index=0
Do While done=-1
doc=Rhino.WorkingFolder & “\” & scriptName & padStr(scriptName,index) & “.jpg”
file=Rhino.FindFile(doc)
If IsNull(file)=True Then
done=1
Else
index=index+1
End If
Loop

getRenderFileName=doc
End Function

Function padStr(prefix,val) ‘this function from Marius Watz
Dim l : l=Len(val)
If l<1 Then
padStr=”000″ & val
ElseIf l<2 Then
padStr=”00″ & val
ElseIf l<3 Then
padStr=”0″ & val
Else
padStr=”" & val
End If
End Function

I’ve been working yesterday in a Circle Packing, and I started with matsys pseudo-code.  I found a lot bugs, finally I decided to make a mixture between his algorithm and mine.  Circle Packing can be a very usefull algorithm and I think until now we have not seen their real power applied to architecture.

This is my little contribuition (pseudo_Code)

1_ Input: maxradius, boundary, iterations (not necessary the number of circles)

2_Add in a random position within the boundary a circle with maximum radius

3_Add a Random Point

4_If this Point is inside of the Circle just created, add another one and delete the old one

5_Add Line to this point (out of the circle) to the center of the circle, (here I use the same idea of matsys) “If the distance is greated than the maximum radius add a circle at that point with the maximum radius. If the distance is less than the maximum radius, add a circle at that point with the measured distance.”

6_ add another point and test if this point is within of any circle and add a line to every center circle to find the closest circle (step _5)

7_ repeat the steps 5  to 6 the number of the iterations

soon more images.

share, modify and send me an Image

best

Option Explicit
‘Script written by <Carlos de la Barrera>
‘Script copyrighted by <Carlos de la Barrera>

Call Main()
Sub Main()
Dim Pt, R
Pt = Array(rnd * 100, rnd * 100, 0)
R = FuncCir(Pt, 10)

Call Pack(R)
End Sub

Function Pack(R)
Dim Pt, i, count

count = Rhino.GetInteger(” number of circles “, 50, 2, 1000)
If IsNull (count) Then Exit Function

Dim ArrData()

For i = 0 To count
ReDim Preserve ArrData(i)
ArrData(i) = R

Pt = Array(Rnd * 100, rnd * 100, 0)

Dim j
Dim t: t = 0

For j = 0 To UBound(ArrData)
If Rhino.IsPointOnSurface(ArrData(j)(1)(0), Pt)Then
Call Rhino.print (”point in surface”)
t = t + 1

End If
Next

If (t = 0) Then
ReDim ArrLine(UBound(ArrData))
Dim k, line

For K = 0 To UBound(ArrData)
line = Rhino.AddLine(Pt, Rhino.CircleCenterPoint(ArrData(k)(0)))
ArrLine(k) = Line
Next

Dim d, d2, l
d = funcDist(Pt, ArrData(0)(0), ArrLine(0))

For l = 0 To UBound(ArrLine)
d2 = funcDist(Pt, ArrData(l)(0), ArrLine(l))

If d < d2 Then
‘Call Rhino.Print (”nothing”)

Else
d = d2

End If
Next

R = FuncCir(Pt, d)
Call Rhino.DeleteObjects (ArrLine)

End If
Next
End Function

Function FuncCir(p, D)

If D >= 10 Then
D = 10

End If

Dim plane
Dim R(1)

plane = Rhino.PlaneFromFrame(p, Array(1.0,0.0,0.0), Array(0.0,1.0,0.0))
R(0)   = Rhino.AddCircle(plane, D)
R(1) = Rhino.AddPlanarSrf(Array(R(0)))

FuncCir = R
End Function

Function funcDist(Pt, circleP, Line)
Dim Ap, j, d
Ap = Rhino.CurveCurveIntersection (circleP, Line)

For j = 0 To UBound(Ap)
d = Rhino.Distance(Pt, Ap(j, 1))
Next

funcDist = d
End Function

the other day I listen: – talk it’s easy,  ¡ show me the code ! - ]]> http://www.designemergente.org/rhinoscripting/circle-packing/feed/ 0 http://www.designemergente.org/rhinoscripting/sensitive-analisys-prato-italy/ http://www.designemergente.org/rhinoscripting/sensitive-analisys-prato-italy/#comments Wed, 06 Aug 2008 09:12:50 +0000 carlos delab http://www.designemergente.org/?p=423 I was invited to paticipate in a contest to the Comune di Prato in Italy. I have to say thank you to this cool group of architects from Lisboa: Duarte Cardoso Ferreira, Nuno Lobo Guerra, Ricardo Boaventura, Rita Frias Silva from ADOC architects and all the team of 4ARQ encharged of the 3D images.

I was encharge to develope by programming the plans and the general features of the school. We start working identify every tree in the ground and the area of the differents rooms for the school. Every tree was identify by a point and a minum area of influence (in the fisrt step of the algorithm) and each area of the room of the school was enter in to the algorithm to know the best performance of the build with out touch any tree.

Then the algorithm calculate a voronoi diagram (only with the trees) and inform the resultant areas and we could see where can “grow” our building. the next step was develope a second algorithm to generate pseudo-random points, between the trees and responding obviously to the influence area of them.

Then the process consist basicaly in create generations and test the results, if the dispositions of points allow build the school (first and more important test), if the result produce nice spaces, if we like it, if the algorithm respect entrance determined by us, etc. etc. after every generation, we pass again this second algorithm to produce in some points a random movement to explore new configurations and results.

I take this idea from Mutsuro Sasaki, he use an strategy based in the approach in successive steps to get the best result moving the points in pseudo random way.

Thi first step was to find the correct data store to find the points. then I put all this points inside of an array and then create the curve. and for the other curves I did the same, searching the even and odd of every point.

I know there are a lot kind of patterns in the textile insdustri, and also my Grandmother know how to create with the crochet technics differents patterns, some of them with very complex estructures. If we thought that an algortihm is and a mathematic or aritmetic rule that is repeated, (Cecil Balmond, Informal, page 112), we will see that my grandmother and all the people who elaborate knitted fabric are actually programming an Algortihm.

I take the post to say hello to this cools Architects, and his interesting work. Dani, Irantzu, Carlos.

Best guys!

Few weeks ago my best friend invited me to propose him a new bookseller for his flat, so my first idea was voronoi!.
we make an a contract, and give me the measures for the furniture, we talk a lot as he would like it and the posibilities using the script and cnc machine for build it. and always the same idea came to me head. we need voronoi diagrams.

This is the contract that we firm this morning in the library, I’m still in the term, almost… and his first sketch. soon the model.

See u soon man.

Genr8 it is developed via API of Alias|WaveFront’s and Combine 3D Map L-System that growth in a digital environment, with gramatical evolution. the seed is designed to react of the digital nature and give to the user the control during the evolutionary adaptation, Genr8 dosen’t have structural or material criteria, and the most of the times the results are closer to the chaos.

Genr8 was Developed by Martin Hemberg and Una – May O’reilly and the people of the Emergent Design Group from the MIT.

Genr8 has a lot of components to create and evolve differents elements, like curves and surfaces.

Attractors, > act attracting surfaces.

Repellors, > similar like attractor but in a oposite way.

Gravity, > as it`s name, act in an uniform way in the global coordinates (x, y, z)

Boundaries, > you can create boxes, surfaces, to act like boundaries of the growth.

Seeds, > the seed by default it is a regular polygon, and you can control the side, starting position of the polygons, also you can define your own seeds, for example drawing curves or using the grammar of genr8.

this example represent a square:

Edge0 + ~ Edge1 + ~ Edge0 + Edge1
Edge0 -> Edge0 [ [ + Edge1 ] – ~ Edge1 ] Edge0
Edge1 -> Edge1 [ [ + Edge0 ] – ~ Edge0 ] Edge1
Angle 90

there are some conditionals to create grammar, In the first line you have to define the Axiom, and only can be a regular polygon, and may only contain ” + “, “~” and Edge(number). Each word should be separated by one space, and the lines need a return. and the comments have to be in separated lines and starting like C++ with two “//”, so there are more elements and rules to create seeds by grammar, but this is an idea how can they work.

To create my Own grammars I start using the predifined types and then looks how they work and so on…

After you define your grammar you have to define the different elements of the growth, for example:

n/ -> the number of the growth steps

s/ -> the sacale of each growth step

rn/ -> the noise that you want in the growth.

fc/ -> fix the center of the growth

ds/ -> if you want draw every step of the growth

and there are too much Mel commands to create and define the environment.

So the plugin has to control: the scaffold, the environment, the Grammar, the Genetic Engine and the Fitness.

The first exercises come from the page and the papers who explain genr8. the other ones are developed by me.

Default Examples:

genr8 -kc

genr8 -fp -sl 8 -n 5 -ba 70 -t 4 -r 0 0 3 -rn 0.1 -s 1.1

polyCube -w 3 -h 4 -d 3
genr8 -t 3 -rn 0.1 -n 4

polyCube -w 3 -h 4 -d 3
genr8 -t 3 -n 5 -a 0 0 4 -g z -0.5

PolySphere -r 5
genr8 -t 4 -n 5 -ba 90 -g z -1 -sp 0 0 7 -sl 3 -s 1.3

genr8 -t 4 -n 6 -ds -s 1.3 -r 0 0 -3 -r 0 4 0 -ba 90 -r 1 -3 -4 -r 2 2 5 -r -3 -2 1

genr8 -t 3 -n 5 -g z -1 -r 0 0 -3

polyCube -w 3 -h 4 -d 3
genr8 -t 4 -n 5 -r 3 3 3 -co

personal experiment:

genr8 -n 5 -rn 0.2 -t 4 -r 0 0 3
-intersting surface results

-Variation 1
genr8 -n 5 -rn 0.2 -t 4 -g z -1 -r 0 0 -3

-Variation 2
genr8 -n 8 -rn 0.1 -t 3 -g z -1 -r 0 0 3 -r 0 0 -3
polyCube -w 15 -h 15 -d 5
genr8 -n 5 -rn 0.2 -t 4 -s 1.2 -a 7.5 7.5 -1 -a -7.5 7.5 -1 -a 7.5 -7.5 -1 -a -7.5 -7.5 -1 -r 0 0 -1
-before to execute, create the polyCube and select it.

-Variation 1 the same thing, select the Polycube before
genr8 -n 4 -rn 0.2 -t 4 -s 1.2 -a 3 3 -1 -a -3 3 -1 -a 3 -3 -1 -a -3 -3 -1 -r 0 0 -1

-Variation 2
-Select the polyCube to get a crazy result in the box.
-or leave it to run free to produce some kind of flower.
genr8 -n 8 -rn 0.2 -t 4 -s 1.2 -a 2 3 -1 -a -2 3 -1 -a 2 -3 -1 -a -2 -3 -1 -r 0 0 0

-looks some familiar element
genr8 -n 8 -fp -t 4 -r 0 0 -5

The iteration is done through an incremental loop prior input of system parameters: quantity of iterations, deviation factor and thickness factor for the branch. Each iteration defines a starting point and two endpoints to build a pair of cylindrical branches.

As the system grows, it will change the thickness of the branch and the opening of the bifurcation. This opening can increase or decrease depending on the function applied to the displacement of the endpoint, defining the deviation.

To make calculations short, for now the system is two-dimensional; meaning that deviation of branches only happens in x, and growth in z.

In the case studies, we can see different combinations of functions for deviation and growth: increasing, decreasing and fixed.

In script execution, the construction of the system is not automatic; it prompts the user to select the branch to bifurcate, so the user can decide the structure to build.

The last image shows a comparison of different structures built with the same system, using the same parameters.

by Ernesto Bueno