# project07:Expert3

## Programming

by Matteo Falduto

### 1. The Arrangement of the Cells

The building is made of a series of individual, interconnected, cells. An initial issue that had been solved thanks to the power of computing is how to dispose those cells in the space. One among the most important forces that have driven the final shape is the need of providing enough solar illumination to all of them, in order to optimize the growing environment for every species of plants. The approach we have used went through the voxelization of our plot: by subdividing our volume in smaller units, we had the opportunity to test and catalogue the performance of a large varaiety of different possible volumetric configurations for our building. We then used the data obtained during this process to construct the optimal shape.

##### 1.1 The voxelization

The voxelization has been accomplished in Grasshopper. The algorithm was fed by a list of generic three dimensional vectors (representing the generic points of a rectangular grid), a spatial domain (representing our voronoi cell) and the dimensions of the single voxel. The result was a transformed list of the input vectors obtained by deforming it and culling all duplicate vectors or those that happened to be outside of the voronoi cell. By altering the components of the input list in a range of discrete, integer values, the algorithm is able to produce an unique set of voxels. Those voxels could be interpreted as one among all the possible distributions of mass inside the voronoi cell.

In order to optimize the performance of the analysis and the efficiency of the script, we decided to represent the cells as single voxels.

##### 1.2 The analysis

The analysis of the set of voxels produced by the previous step has been the most challenging part of the task, both at the conceptual and computational level.

We had to come out with a series of quantitative values that could be used to score a particular configuration of voxels. At that stage we had identified four parameters that had to be kept in consideration during the analysis: the average solar irradiation of the surfaces, the distance between the single cells, the number of neighbouring cells that every cell had and the total population (amount) of cells.

###### 1.2.1 The Solar analysis

In order to perform the solar analysis we "materialized" the voxels by assigning to every vector produced at the previous step a box that would roughly approximate each of our cells. At first we considered to use Autodesk Ecotect as the analysis engine, but we soon discovered that any implementation of it would have runned way to slow for our purposes, making it unfeasible to test a large enough variety of different configurations. This was partially due to the fact that every configuration had to be exported from grasshopper to the Ecotect software. We therefore looked for a custom integrated script that, while being less accurate, would have delivered a result in a fraction of the time required by Ecotect. Keeping in mind the peculiarities of the geometry to analyze, which substantially is a grid of identical boxes, we could apply some specific considerations.

An interesting insight came from the algorithms used in computer graphics for displaying lines: those are a family of highly optimized pieces of software that, given a canvas of pixels and the characteristics of a line to trace (like its starting point, direction and length) would determine how to display it on screen, i.e. which of the pixels would became black and which would remain white. In particular we studied the Xiaolin Wu's line algorithm, an efficient, thus simple algotithm broadly used to generate an antialiased line.

We had the idea that, If we were able to implement one of those algorithms for a 3d structure of voxels instead for a 2d array of pixels, we could trace from every cell of our given population a line parallel to the sunlight direction to analyze and assume it to be the "path" of shadow casted by that voxel. Since the line is generated by an anti-aliased line algorithm and has the same "thickness" of a voxel, we could interpret it's rendered form as the real shadow that affects all the voxels on its path: a voxel that happens to be completely black would indicate a cell completely in shadow; viceversa, a white voxel a cell unaffected by that shadow. Every value of gray in between would characterize a cell only partially shadowed (more or less according to the luminance of the voxel). By multiplying, voxel by voxel, all the values generated by all the rest of the voxels, we would obtain the total volumetric shadow map of the entire configuration. This map could be used to evaluate the solar performance of the given configuration, as, for example, by taking the mean value of this shadowing score for all the cells.

In practice, since an actual volumetric (over the classical 2d) implementation of the Xiaolin Wu's algorithms presented some difficulties we decide to trade off some of it's efficiency for the sake of code simplification. We have therefore proceeded implementing the same concept with a geometric approach achieved by minimizing the scripted parts while making a more extended use of standard grasshopper components.We proceed as follows: first, providing one or more significant solar directions as vectors, we generated form every center point of every voxel a line with that direction. We then calculated the distance of it from all the other center points. Those values were compared with a "radius" value that represented the radius of our cells cell. This means that if a given center point dists from the line previously calculated more than twice the radius, the voxel represented by that centerpoint would not receive any shadow from the voxel that casts the line, in the other case, it would appear shadowed in the proportion of it's distance compared to twice the radius. The image on the right shows a simplified model of this concept, where y represents the radius, x the distance between the center point and the line and D the solar direction. The relative amount of shadowing η that the cell A would receive from the cell B would be η=x/2y.

By superimposing all those scores calculated for every casted line on every voxel, we could obtain a map of the amount of shadow received by every cell. By this means we could assess the solar performance of a given cell configuration.

The first attempt of creating a component that could carry out an analysis in the fashion previously described is showed in the image above. The y parameter is the radius of the cell, S the centerpoint of the cell from which cast the shadow and D the considered direction of the sunlight as a vector. The VB.net component is a simple gate condition that outputs 1 if 2x>y, otherwhise it outputs 2x/y:

If 2x > y Then A = 1 Else A = x / y End If

This is because, for the sake of this analysis, there is no difference if a given voxel is in not shadowed by a hair's breadth or by far. In this way, a voxel would get a score of 1 (that is fully lit) if the distance of its centerpoint form the axis of a given shadow is larger than the considered voxel radius, otherwise it gets, as score, the ratio between that distance and the radius. To make it clearer, a score of 0.5 indicates that the distance is the half of the radius, therefore the voxel is only lit by half.

Then, in order to sum the contribution of all the significant "shadow lines" on a given cell, we have decided to consider, among all, only the two lines that were responsible of the highest shadowing score and adding their contribution taking into account their relative angle in relation to the cell; so, if the two lines affected the cell *from the same side* the contribution of the second over the first would be minimal (because the two shadows would mostly cover the same surface of the cell), in the other case their addition would be complete.

###### 1.2.2 The distance score

In addition to the solar analysis we implemented a scoring system that forced the solution towards maximizing the average distance between the cells. This was dictated by the will of making the best use of all the volume available. This has been achieved by simply calculating all the distances between all the cells and obtaining the average of them.

###### 1.2.3 The neighbouring score

Another important factor we considered to impose, besides the solar analysis (that imposes some spatial relation on the big scale) is a set of rules to govern the spatial relations between cell on a small scale. Those kind of relations regarded the "neighbouring" cells, that are the cells that have an interface between them.

We have determined that the best condition for providing air, connections and structural feasibility is by stating that every cells should have two or three neighbours.

To induce this behaviour we had first the need to find a system to assess it. Thanks to the rigorous array that underlaid to all the cells the task was quite simple. The image below shows how it was made.

Where P is the list of points to analyze, h the height of the cells (it means the vertical distance between the centerpoint of a cell and the other) while d the same thing but for horizontal dimensions. S is the lists of scores for every entry of the list P. The algorithm looks for a centerpoint in all the six possible direction (the cells are boxes) and scores that point consequently. The appointment is demanded to the VB.net script that is:

If x = 0 Then A = -8 ElseIf x = 1 Then A = 0.1 ElseIf x = 2 Then A = 0.5 ElseIf x = 3 Then A = 0.25 ElseIf x = 4 Then A = -0.5 ElseIf x = 5 Then A = -2 ElseIf x = 6 Then A = -10 Else A = -10 End If

###### 1.2.4 The population score

Running some early versions of the code explained above, without any surprise we found out that the system, in order to maximize all the other scores, would converge to a configuration with a low number of cells. This is because a small population, in that sense, would improve the average solar performance of every individual cell (less cells to shadow other cells). For that reason we decided to impose a strong evolutionary pressure for the system to force it to evolve towards a desired population, considered as a part of the architectonic program. This has been achieved by a simple convergence function. A generic expression of that function could be S=|x-y|^1.3, where S is the score that needs to be minimized, x the count of cell for a given configuration and y the desired number of cells. The more x differs from y, the more S gets big. The 1.3 factor assures some relative freedom for the system to converge to a solution with a slightly different number of cells, whether this may apport some important advantage for the other scores, but firmly excludes any significant deviation from it. The exact 1.3 value has been guessed from practice.

##### 1.3 The Generative Algorithm

We used Galapagos to compare all the different scenarios in order to pick and refine a near-optimal solution. After some tries we have noticed that an efficient approach to the problem is to use the Simulated Annealing solver to obtain a first set of possible solution and only at that stage engaging the evolutionary solver. It would pick the best solution found so far and refine it by inbreeding it with other near as good options. For the Evolutionary solver we have used a population value of 100. This is because the high multiplicity of the problem: more the finding the "sweet spots" on a continuous range of genotype that would directly alter the phenotype, the kind of the problem was such that a small variation of the genotype would constitute a phenotype with a significantly different fitness. The problem was more about testing a large enough set of possible solutions and picking the best, rather than fine tuning a solution already near to the optimal one. We composed the fitness score F as F=x*(y+z+120+u), where x is the solar performance index (an intensive rather than extensive quantity: it is independent of the number of cells), y is the average distance between cells, z the "neighbouring" score, and u the population score. The +120 term is to keep the value inside the parentheses always positive. The final analysis has been executed on a i7-2720QM laptop with 8GB of memory, but, because of an intrinsic limit of the software, Grasshopper was able of using only one thread of the eight available, therefore taking advantage of only 12.5% of the processor power. The simulation run for four days.