Minimal Parquet Deformations
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. If you change the type of graph you’ll see a sort of representation over a simple pattern deformation based on rotating X’s.
It is becoming a significant research topic to introduce students of architecture to systems thinking in the form of patterns and their deformations. Therefore, the Parquet Deformation exercise is about the tessellations of the plane that gradually shapeshift in two dimensions. We must do this without gaps or overlaps. The exercise encourages students of architecture to think about the geometric relationships between the sequences of continual shape-shifting while developing reasoning about a pattern as a structural whole. This is expected to be explored by morphing the cells of a pattern while sustaining its visual continuity and rhythm. This study is a continuation of the previous study on the reconstruction of parquet deformations via contemporary parametric modeling tools. Minimal parquet deformations Grasshopper algorithm can be further studied into a set of custom components. Thus, maybe an add-on in the future. I hope that one day, I can do that.
Cite this post
Related Posts
Point Waves
May 29, 2023
Here is another basic exercise in Grasshopper. This exercise “Point Waves” creates wave-like deformations on the grids of points. The major function of the definition is to calculate the distances from every point of a grid to an attractor point, with the help of Distance (Dist). Then it sorts them from the smallest to the largest (= closest to farthest) with the Sort List (Sort) component. This component takes and matches two lists of the same size, called key (K)…
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…
Parquet Deformation of Star Patterns
February 3, 2012
This is another starting point for pattern generation study in a dataflow environment. I tried to implement the parquet deformation of Islamic patterns in Grasshopper. I studied Hankin’s method of Islamic Pattern generation. Then I tried to simulate his process beginning with basic regular tiling (regular hexagonal tessellation). Craig S. Kaplan (here) explains this and other methods in his dissertation. A Simple Foundation We have already experienced the result of exploding any hexagonal grid, shifting its points with the help…
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….
Point Attractors Revisited
February 29, 2012
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…