Point Attractors Revisited
This is the basic definition of one point attractor on a grid of points. Here, the fundamentals of data tree matching can be studied. A hexagonal grid is exploded into points and new polygons are created there. Instead of a standard point distance relation to polygon size, this time the distance factor affects the rotational angle of these polygons. Although the structure of data trees is getting complicated, this has no difficulty in such definition, because the operational complexity is still very simple. This means, we might use complex data trees, however, the definition itself should remain simple; allowing us enough CPU for sketching.
Cite this post
Related Posts
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…
Grid Tearing
January 6, 2012
Here, I used a curve to accomplish grid tearing. It’s straightforward, and from an educational perspective, this exercise includes several potentials on vector arithmetics and graph manipulation techniques. As a design domain, this definition stresses the use of associative entities in a parametric model. Any primitive or complex entity may evoke different parameters in others. The beauty in the simplicity of these algorithms still amaze me.
Attractor Basics
June 29, 2023
In this short tutorial, I want to give Grasshopper beginners the basics of how we create attractor systems. The Grasshopper definition you see in the below figure is the equivalent of array-type copying operations in CAD. However, unlike in CAD programs, here we are dealing with multiple generations of objects rather than transformations. Attractor Basics: Data Matching In the application you see in the figure below, each row of the hexagonal grid created with HexGrid has a different radius value….
Minimal Parquet Deformations
January 28, 2013
Is it possible to model a two-way parquet deformation using only native components of Grasshopper? In this definition, I limited myself to 10 of them. Parquet deformations are a very interesting and pedagogical topic to teach some of the basics of contemporary parametric modeling. This post explains a minimal parquet deformations algorithm in Grasshopper. However, this has its own limitations. You will see that the definition generates the attractor graph curve. Because the graph input tool creates the magic here….