Basic Design Studio at Bilgi University is coming to semester’s big final. Nowadays, students are trying to build their final projects. Oğuz and Gupse’s group has a truss structure with nearly 800 segments. They attempt to build it by taking length values from their own Rhino model by hand. And this itself had brought a difficulty, because one person of the group should be assigned only to do this measurement, reducing their workforce. They asked me if there is an…

After the starting point of the Galapagos, there came another attempt to utilize this beautiful addition of David Rutten. This time, I worked over the night to tell it what I want. The aim was (or seemed to be) simple at first sight. I wanted several shapes (not one) to fit into an area, as smallest as possible, without overlaps. This is packing objects. A bounding box and area components quickly gave me the first fitness value. The area of the…

Galapagos was a great improvement when it became available natively within Grasshopper as an Evolutionary Solver. However, I couldn’t find time to examine it until recently. This examination gave me an idea of algorithmic thinking, tool making, and tool using. The first experiment shown below tries to solve equilateral triangulation, based on the Delaunay method. Galapagos has two different solvers, named “simulated annealing solver” and “evolutionary solver” shown respectively below. Both of them are trying to reach a fitness value…

The tetrahedron is a popular platonic solid for designers. We’ve explained how to draw them using equilateral triangles here before. Recently I’ve found (sorry, lost the web address) a much quicker way of modeling a Tetrahedron using a cube. It’s very simple, just connecting the three opposite corners of the cube automatically makes them equal, resulting in the four equal faces. Of course this time you’ll have to calculate the actual edge length, but if you use the “box diagonal”…

…While it is true that every curve which can be described by a continuous motion should ve recognized in geometry, this does not mean that we should use at random the first one that we meet in the construction of a given problem. We should always choose with care the simplest curve that can be used in the solution of a problem, but it should be noted that the simplest means not merely the one most easily described, nor the…

Digging out with Grasshopper, Rhinoscript, and Paneling Tools, everything seems to be more and more automated and fast. However my colleagues Mete, Benay and Elif reminded me that, we can always do much with those high-end architectural geometry tools, but we still have to understand and follow the roots, probably best described by the “manual ways”. Sometimes using these methods would be much more intuitive as they are SLOW enough for designers to think about what is going on there……

Experimenting with various plug-ins for solar calculations, I found Daniel Da Rocha’s robust implementation of the solar position algorithm in vb.net. It calculates the solar angle of any place and time. Although it’s written in the old vb.net component, it still works great. I’m trying to create a fast and easy workflow to optimize Grasshopper models based on solar directions. This is done by projecting faces to the solar planes and checking how much of their area is included in…

Today, there are pedagogical and practical challenges on the use of algorithms in architectural design, as computer puts not only a physical but also a cognitive layer between designer and the subject. Formulation of this cognitive layer is becoming important, regarding which model of computing is used to connect designer with the subject. Is it a “designerly” search, or design exploration in a visual programming environment? As most of the researchers admit that visual programming environments are very effective in generating variations,…

This is the continuation of my scripting experiment within Grasshopper. Like the minimum spanning tree algorithm, this is also a famous problem of computational geometry; the shortest path problem. I’m now coding faster and understanding the namespace more easily in Grasshopper. This time, the challenge was implementing Dijkstra’s algorithm for the Shortest Path Generator. Again, it’s a quite powerful algorithm, I even plan to use it in my current project. Although there is a faster alternative, Shortest Walk-in Food4Rhino and it…

This is the basic form of a surface division, based on curvature. As each point on the surface has a curvature value, this might be used to dispatch those values and see the points at flat and curved parts of the surface. I used my favourite surface equation definition (here) as implemented equation of cos(x)+cos(y) in the animation below.