Hoopsnake: Looping Definitions
Wow! Is this possible in Grasshopper? In order to start creating recursive algorithms in Grasshopper, I finally managed to run Hoopsnake, a special component developed by Yiannis Chatzikonstantinou. This will help me develop parametric models that include loops. The fundamental experiment here shows a surface subdivision based on iterations. We should define a starting object or data, an operation to be repeated, and a limit that will tell Hoopsnake to stop looping. In this condition, this is the area of the surface, put into a logic (larger than…).
Notice that while using Hoopsnake, we’ll have to use right-click commands “Loop” and “Reset” to start and reset our loop. However, this creates a conflict with Grasshopper’s real-time design sketching ability. But combined with emergent shape recognition, I think Hoopsnake would maximize the designer’s potential for parametric modeling.
Cite this post
Related Posts
Tree of Life
August 12, 2023
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…
Trees and Recursive Computing
March 15, 2012
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…
Ice-ray Lattices
February 5, 2012
The design of Chinese window lattices named “ice-ray” is one of the classic studies of Shape Grammars. It is an old and good example of algorithmic design. George Stiny explained their geometric construction based on the parametric Shape Grammars approach. He explained shape rules and the abstract machine that produces the subdivisions. I was especially interested in Shape Grammars when I was a graduate student. I even made a prototype tool for Shape Grammars in MaxScript. Here is another post…
Basic Grid Deformation
July 5, 2023
I am still trying to find the simplest solution to some geometric definitions. This is why I called this Grasshopper definition “Basic Grid Deformation”. Here you see the Curve Proximity (CrvProx) component in use. This component calculated the shortest distance between two curves. I think the underpinnings of this component are very interesting. I hope I can code it in Python one day. In order to see the result more clearly, the Previews of the Interpolate Curve (IntCrv) and Square…
Inflating Grids
December 28, 2012
After playing with vector fields in 2d (here) it was quite easy to create a 3d surface deformation. Here is my first experiment on a regular triangular grid’s three-dimensional behavior within a vector space, that includes a point charge of varying z coordinates. That makes field lines escape to a bounding box, instead of a bounding rectangle. Again, you may play with force decay, the number of samples, and the “grid blast” parameter, which is just a t-value evaluation of…