#tree

A fractal is a complex geometric shape that we can split into parts, each of which is a reduced-scale copy of the whole. This property is self-similarity. Fractals often exhibit patterns that repeat at different scales. We can find fractals in nature, such as in snowflakes, mountain ranges, trees, and clouds. We can also generate them mathematically. Fractals have applications in various fields such as physics, biology, and computer graphics. We use them to model natural phenomena, compress data, and…

This Grasshopper exercise is a special one. I used Hoopsnake components to develop the branching design I studied earlier here. This time I multiplied the number and orientations of several tree structures to generate my interpretation of the Tree of Life. The challenging part of the algorithm was to finalize every branch tangent to a predefined circle. Group 3 handles this issue by utilizing a Blend Curve component. There are many Number Sliders to play with the design. Thus, I…

The Animated Tree Growth is an interesting study for Grasshopper. First, I developed a regular tree generation definition similar to those I studied earlier, here, here, and here. In component group 1, I develop an initial generator arc. Then, in group 2, I generate the fractal tree by using iteration. I did this with the help of the Anemone add-on. The interesting and original part of this definition is group number 3. Here I am trying to trace the growth…

Let’s make some nostalgia. I thought of a very simple and useful algorithm that I can generate with Grasshopper. At the concept stage in architectural projects, I tried to derive figures that could symbolize the trees on the land. To make random low poly trees in Grasshopper we need several lists of random numbers first. The Facet Dome component will meet all our needs. In the code I shared on this page, I arranged the data tree structure to handle…

This is a classical method of generating tree-like forms utilizing a simple command “Arc SED”. The idea is simple, as the command draws arcs using an input direction vector, so this could easily be implemented creating a “smooth” composition of curves just by iteration. Actually, this has been a previous study, discussed before here, using Hoopsnake. Now, this time I’m implementing the same algorithm using Anemone and a couple of other changes. Here is the Grasshopper definition (Anemone Components should be…

Based on this post, the problem of modeling tree-like fractal shapes is still a good question for the early years of computational design education. Last time, I used Rhino’s macro to study these fractal trees in an “impossibly” limited interface. But this time I used a VB.NET script. Here is the code inside of the VB.net component: Here are the inputs. x is the number of iterations. The Crv input is a line needed for the first iteration. t represents how…

While testing Anemone components for Grasshopper, I accidentally generated these branches by looping. In fact, I was trying to develop the definition that mimics the well-known “Arch SED” component method. This method uses the tangent vectors for the endpoints of the arcs. Then, it iterates the process in a random fashion so that the branches (arcs) join nicely. Anyway, this definition develops new branches from a previous one. It does this by using three graph mappers for the position, rotation,…

Today’s design computing class was about fractals. In Rhino, writing macro statements are very easy to learn as it just mimics your behaviors in a sequential text. There are a few syntactic rules that we should know. First, you should watch the command line carefully to understand the steps of your design process. Each command in Rhino requires different inputs from the user. In macro, you may enter these values or tell the macro to ask the user by typing…

This topic of trees and recursive computing is inspired by the method shown here at the Rhino Python 101 Primer. This is a beautiful method of recursion that creates tree-like shapes, composed of arcs. I constructed these arcs by using the Arc SED (start, end, direction) method. This requires start and end points and a vector that is tangent to the arc (at the start point). Therefore, the overall look of a chain of these constructions creates curves with continuous…