### eCAADe 2020:

Proceedings

FRACAM: A 2.5D Fractal Analysis Method for Facades; Test Environment for a Cell Phone Application to Measure Box Counting Dimension

**Talk and Proceeding**: eCAADe 2020 - RAnthropologic – Architecture and Fabrication in the cognitive age (Berlin, Germany, 2020 | virtual conference) FRACAM: A 2.5D Fractal Analysis Method for Facades

W Lorenz, G. Wurzer

eCAADe-conference, Berlin, Germany (virtual conference), 2020,

presentation (video)

### CAADRIA 2020:

Proceedings

FLÄVIZ in the rezoning process: A Web Application to visualize alternatives of land-use planning

**Talk and Proceeding**: CAADRIA 2020 - RE: Anthropocene, Design in the Age of Humans (Chulalongkorn University, Bangkok, Thailand, 2020 | virtual conference) FLÄVIZ in the rezoning process: A Web Application to visualize alternatives of land-use planning

W Lorenz, G. Wurzer

CAADRIA-conference, Bangkok, Thailand (virtual conference), 2020,

presentation (video)

### USA Chicago Exkursion 2019

Japan Exkursion 02.07.-17.07.2019 (book) W.E. Lorenz, A. Faller (Hrsg.). Mit Beiträgen der Teilnehmerinnen und Teilnehmer der Exkursion nach "Chicago" (2019).

ISBN: 978-3-9504464-2-5

Das Buch beschreibt in einzelnen Kapiteln die vom Institut Architekturwissenschaften, Digitale Architektur und Raumplanung, organisierte Exkursion nach Chicago aus dem Jahr 2019. ...

### Stegreifentwerfen "gesteckt nicht geschraubt 2.0"

digitales Stegreifentwerfen

G. Wurzer, W.E. Lorenz, S. Swoboda. Im Zuge der Lehrveranstaltung wird die Digitalisierung vom Entwurfsprozess bis zur Produktion an Hand einer selbsttragenden Holzstruktur untersucht: vom Stadtmöbel über die Skulptur zur Brücke. ...

## 3.1 The “true” Mathematical FractalsThe development of this kind of fractals consists of simple rules - a starting image, the so-called initiator, is replaced by another image, the so-called generator. But nevertheless they are very complex and always strictly self-similar: it does not matter which part we analyze, it always looks exactly like a scaled down copy of the whole set. The tools to create such fractals are called iteration and feedback: Iteration means that the procedure is repeated based on the result of the previous step. |

## 3.1.1 Cantor SetFor producing the Cantor Set[01] the initiator, a straight line of a certain length, is replaced by a generator consisting of two lines, each of the length of 1/3 of the initiator, in such a way that the new lines are located in each case at the end of the initiator. From that an open middle interval of the same length as the lines of the generator emerges but this “hole” does not include its end points - these points belong to the two outer parts, marked 1 and 2 in picture 08. This geometric rule is repeated again with the two new lines, which leads to four lines and so on. |

picture 08:Cantor Set In theory the thickness of the Cantor Set is nearly zero, but for illustration purposes I used some thickness. The hierarchy on the right gives the cascade of the number of parts at each step. |

1. Self-similarity from the large to the small scale: Any part of the Cantor Set is an exactly scaled down copy of the entire Cantor Set. 2. The clustering of the points in the Cantor Set is similar to natural systems with a random factor being added - e.g. the distribution of stars displays a clustering in their layout rather than an even or strictly random distribution of features. The distribution of rough diamonds in the earth's crust is quite similar to the distribution of stars and galaxies in the sky - Benoit Mandelbrot presented such a comparison in his book "Die fraktale Geometrie der Natur[03] . If we mark every diamond-mine and every place of discovery - old and new one - on a world-map, the density of these marks will look irregular from a great distance: some are isolated and most are concentrated in some few regions. In these regions the distribution of diamonds is not regular either. On closer observation, there are again only some isolated concentrations of diamonds within "poorer" regions, which looks similar to the whole like a scaled down copy. What we see is a two dimensional translation of the Cantor set. This sounds quite similar to the distribution of centers or the distribution of high density of population: both offer a clustered pattern. For example a city consists of areas of high-density within regions of lower density, and on a world-map the distribution of cities again looks irregular, with large regions of no density in between. |

## 3.1.2 Sierpinski GasketFor producing the Sierpinski Gasket[04] , the initiator, an equilateral triangle, is replaced by a generator consisting of three equilateral triangles, each of the size of half the initiator, in such a way that the new triangles are located in each case at the three corners of the initiator. In other words an equilateral triangle is cut out in the middle. This cut-out triangle is half the size of the initiator and rotated by 180 degrees - the side-points of the triangle are defined by the midpoints of the sides of the original triangle. The same procedure is repeated for each of the three new triangles, and so on. The remaining triangles or the set of points that are left after infinite iterations is called the Sierpinski Gasket. For further details see picture 09. |

picture 09:Sierpinski Gasket The initiator is an equilateral triangle - colored black -, the generator are three equilateral triangles of half the size - colored grey. |

## 3.1.3 Koch CurveThe initiator of this fractal is again a line, the generator four lines of 1/3 of the initiator[05]. For their creation, the initiator-line is divided into three equal parts, with the middle part being replaced by an equilateral triangle of the side length of 1/3 of the initiator - the lower part of the triangle, however, is taken away. This procedure is then repeated for the four new lines. After infinite steps the construction leads to the Koch curve - the geometric rule for this fractal is shown in picture10 together with a description why this curve belongs to fractal geometry. |

picture 10: Koch curve The construction rule given by an instruction for a walk: for the first iteration one starts going 1/3 of the starting line then turning 60degrees to the left, moving again the distance of 1/3 and turning two times 60 degrees to the right. After having covered the distance of 1/3 one turns again twice 60 degrees to the left and finishes the walk by the distance of 1/3. |

The Koch curve demonstrates how one can get a curve of infinite length. The original line, the initiator, may have a length equal to one. This line is replaced in the first step by four lines, which is called the number of pieces |

## 3.1.4 Minkowski CurveFor constructing the Minkowski curve the initiator, a line of e.g. a unity length equal to one, is replaced by a generator consisting of eight lines. These eight lines, each 1/4 of the original line, are arranged in the following manner: horizontal lines, which are kept in position, build the first fourth and the last fourth of the original line. The second fourth consists of a line turned up 90degrees, followed by a horizontal line and finally by a line moving down 90degrees again. The third fourth is constructed by a sequence of lines that is first turned down 90 degrees then moving horizontally and finally turning up 90 degrees again to connect the last fourth. This rule of construction is then repeated for all eight new lines of the first iteration, 64 lines of the second iteration, 512 lines of the third iteration and so on - see picture 11. |

picture 11: Minkowski curve If the kind of orientation of the generator is chosen by random for each line the resulting curve will be called the random Minkowski curve. The dark and the light line show the two possible orientations of the middle part of the generator. |

In comparison to the Koch curve the length of this curve grows even faster from one stage of construction to the next. The length is measured by the equation , the generator again being a line with the length of one. After the first iteration the length is given by |

picture 12: Mathematical fractals with a chance factor Whether the middle part of the generator of the Koch curve moves up or down is chosen at random, that means = +60° or -60° and = -. Such a procedure can produce structures similar to natural coastlines: |

## 3.1.5 Peano CurveThe initiator of the Peano curve[06] is once more defined through a straight line and the correspondent generator consists of nine lines 1/3 of the initiator. The first line of the generator runs horizontally, the second turns up by 90degrees, then a horizontal part follows before the curve turns down again by 90 degrees. The fifth line moves back to the end of the first line without touching it. The next part of the curve heads down by 90degrees, followed by a horizontal part before it goes up again. Finally a line located in horizontal position again forms the last section - see picture 13. |

picture 13: Peano curve The length of this curve increases by , with one being the unity length of the initiator. From that the first iteration leads to a total length of , the second iteration to , the third iteration to , and so on. |

The Peano curve offers a paradox. It is a curve that fills the surface it is lying on after infinite iterations. So this curve is at the same time a one-dimensional entity, a line, and somehow also a two-dimensional unit, a plane. The phenomenon we find in this structure is the fact that a one-dimensional curve, in Euclidean terminology, has a fractal dimension of two. |

## Footnotes[01] Georg Cantor, a German mathematician, created the Cantor Set in 1883. He worked on the foundation of set theory. |