Computational Geometry

As the design of free-form architectural surfaces becomes easier, questioning and foreseeing the feasibility of the construction of these surfaces becomes important. Such an inquiry requires sufficient knowledge of architectural geometry besides the knowledge of materials and structural systems. In this article, we present a…

This Rhino Python code calculates the cross-product determinant used to determine the orientation of three points (current, next_point, and point) to see if they form a left turn or a right turn. This is a well-known technique in computational geometry to check the relative orientation…

Boris Nikolayevich Delaunay was a Russian mathematician and mountain climber. He developed the Delaunay triangulation, which is a method in computational geometry. It is a triangulation of a set of points such that no point is inside the circumcircle of any triangle formed by the…

This is a simple trick that shows the utilization of the “surface split” component in Grasshopper. It is used for detecting the inner regions of any given two-dimensional linework. Thus, it resembles the hatch boundary detection of AutoCAD and similar software. There is no built-in…

Today’s tip is about two-dimensional curve-point calculations. It is very handy to use “closest point” components in Grasshopper. You can calculate distances and directions between curves, surfaces, and points. Then, place point objects in relation to the proximity of another object. However, there is no…

After becoming a ready-made component in Grasshopper, the Delaunay triangulation lost its popularity quickly. It used to be a nice problem of computational geometry for designers obsessed with scripting.  Last month, Benay reminded me of the method of circle checking. She showed her Rhinoscript that…

I’ve been searching for a method to study the Voronoi subdivision in order to manipulate it. There are well-known algorithms for that. But I thought it would be better if I use a projective approach just as I did in studying hyperbolic space (here). This…

The Möbius strip is a famous mathematical object. Although being in three-dimensional space, it is a closed-loop of only one surface and only one edge. This quality alone makes the object an interesting study for computational design. I aimed to create an object to test…

Yesterday, Kağan asked me about the isovist component in Grasshopper and how it works. In fact, it is a long story, I said because once upon a time, I was curious about Space Syntax theory as my old friend Ela Çil introduced it. So, here…

Playing with the 2D Metaball component in Grasshopper. I was curious about why there are no Metaballs in 3D in Grasshopper. Then, I realized that in fact, the 2D Metaball component is creating a section of a 3D Metaball computation. I think it is a…

This is the continuation of my scripting experiment within Grasshopper. Like the minimum spanning tree algorithm, this is also a famous problem of computational geometry; the shortest path problem. I’m now coding faster and understanding the namespace more easily in Grasshopper. This time, the challenge was…

This is the updated version of my MST code from 2012. After over a hundred hours of Rhinocommon and Grasshopper SDK studies, and lots of dead ends, I was finally able to calculate the minimum spanning tree of any given curve network in Grasshopper. Problems…

That was about six months ago, our study for a design competition required a spatial allocation algorithm. An office building with a rectangular plot and a strict functional requirement forced me to the good old Voronoi diagrams, subdividing a surface. Here is the definition file: [GHX:…