designcoding
About Table of Contents Keywords Monthly Archive
Support designcoding!

#anemone

10 posts

Dragon Curve Fractal

December 25, 2023

This week’s fractal is the famous Dragon Curve. Dragon Curve exhibits self-similarity, meaning parts of the curve resemble the overall shape, regardless of scale. It’s fascinating because a relatively simple construction process generates a complex and visually captivating fractal pattern. The Dragon Curve is often used to demonstrate fractal properties in mathematics and is popular in recreational mathematics due to its intricate and beautiful patterns. It has applications in computer graphics and is interesting in studying chaos theory, self-similarity, and…

Cesaro Fractal

December 19, 2023

In this study, I explore Cesaro Fractal, generated by Grasshopper. Usually, it is not possible to code recursive algorithms in Grasshopper. With the help of the Anemone add-on, these fractal curves are easy to model. I studied similar fractal algorithms here before. This one is very similar to the Koch’s snowflake. The only difference (as far as I understood) is the side of the spikes. Koch’s Snowflake generates triangular spikes pointing to the outside of the polygon. Cesaro Fractal does…

Koch Snowflake Fractal

April 12, 2023

This is an implementation of the famous Koch Snowflake Fractal in Grasshopper. We will be using the Anemone add-on to handle the iterations. In this fractal, we start from an equilateral triangle. Then, we form new equilateral triangles, one-third of the side. So that each repetition protrudes in the middle of all the sides. In summary; The Preparation for Koch Snowflake Fractal Now let’s follow the Grasshopper application step by step. We start Koch Snowflake Fractal by creating a triangle…

Gosper-Peano Curve in Grasshopper

August 19, 2017

Anemone components are still working great, extending the abilities of Grasshopper. Here, I studied a space-filling (or plane-filling) fractal called the Gosper-Peano Curve. You should be very careful about the number of iterations (the N input). Because it can crash your Rhino if you change it to more significant numbers. Also, you should have Anemone components installed in order to run this definition. The generator curve is a special one. This website explains the generation of the curve from the…

Arc Tree Revisited: Anemone Update

April 26, 2015

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…

Ice-Ray Lattices Revisited

April 9, 2015

Further studying iteration in Grasshopper, this time, inspired by George Stiny’s “Chinese Ice-Ray Lattice” subdivisions with Aneome, instead of the Hoopsnake add-on I tried in the previous work. As you know, loops add various ways of usage to Grasshopper. In future versions, loops may cease to be just an add-on and become native components of Grasshopper. Until then, loop plugins like Anemone take on this task. In the example here, we create an application by throwing random lines to divide…

Tetrahedral Helix and Snake Game

January 2, 2015

This is the Grasshopper definition that generates a tetrahedral helix (also called as Boerdijk-Coxeter helix) but in a funny way. This geometry is also a solution for tangent spheres. I generated the helix using Anemone components for recursion and gave it a little bit of responsiveness. I don’t know if it depends on the speed of your CPU but if it is slow enough, you’ll see the snake game of tetrahedral helix as it is driven by your input from a…

Branches by Looping

May 9, 2014

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,…

Edge Bundling

February 17, 2014

I’ve been searching for a way to implement edge bundling on Grasshopper. It is an effective visualization technique that you can use in connectivity diagrams. There are a couple of different approaches to this problem. It is a nice way to analyze common paths within crowded graphs. I’ve found several entries in the Grasshopper blog about this subject, but only implementing Kangaroo seemed to be a complete solution. My approach is of course not a scientific one, but after the…

Anemone for Grasshopper

February 16, 2014

Anemone is a simple but effective plug-in for Grasshopper that enables loops. It has been a while since Hoopsnake succeeded in extending the dataflow capacities of Grasshopper with recursion. However, Anemone is much more user-friendly and easy to use. Below is my first test, yes it works! Here is the group page on Grasshopper. I hope this plug-in would be advanced more. I’ll try to return to my old studies which ceased because of the lack of this functionality. This…

  • Chapters

    • Algorithms
    • Discourses
    • Fabrications
    • Studios
  • Explore

    • All Keywords
    • Table of Contents
    • Monthly Archive
    • #graph-mapper
    • #tensegrity
    • #aluminium
    • #noise
    • #attractor
    • #quad
    • #boolean
    • #folding
    • #parametric-wall
    • #cuboctahedron
    • #facade
    • #nesting
    • #optimization
    • #paper
    • #rubber
    • #koch
    • #polygon
    • #brick
    • #truchet
    • #virtual-studio
  • Search

  • Support designcoding!

  • Enjoying designcoding? Support me on Patreon to keep it growing. Thank you!

  • copyright 2026 designcoding.net | about | privacy policy | end user license agreement