Grasshopper

algorithmic modeling for Rhino  Spatially varying fields, which associate a value (such as a number or a vector) to every point in space, have a wide range of applications.

I wanted a simple way of defining such a field in a Grasshopper script component as an equation, or a function of distance to some geometry, then passing this field to another script component, in a way that the downstream component can easily query the value of the field at any point. For speed reasons I did not want to do this by passing millions of sample values.

Various tools for fields do already exist in Grasshopper, both natively and as plugins, but of the ones I looked at, I couldn't find any that provided the flexibility and speed I wanted, so I put together a very simple library. For now this includes scalar, vector and frame fields.

With the scalar fields, I also made an implicit surface tool. These are also sometimes called isosurfaces or level sets, and they can be thought of as the equivalent of the contours of a heightfield, but in one dimension higher. A scalar field has a value everywhere in space, and the surface is where it switches from negative to positive, or crosses some given threshold value.

Probably the most popular approach to isosurfacing is an algorithm called marching cubes, which checks values of the field at the 8 corners of each cell of a cubic grid, and assigns each cell one of 256 pre-defined possible polygon topology configurations depending on how the field changes values between the corners, with some interpolation for the positions. There’s also a variant of this using tetrahedra, which I’ve played around with in the past (0,1,2).

Here I've come up with a different approach, consisting of two stages.

The first part of this is a voxelized threshold of the field. The value of the field is queried at the points of a 3d grid, and the ‘cell’ centred at each point is assigned to either in or out, then we take the faces of the cells which divide inside from outside, giving us a sort of chunky stepped approximation of the surface.

However, instead of using cubic voxels, I use truncated octahedra. This 14 sided polyhedron tessellates to fill space, and can be seen as the Voronoi tessellation of the points of a body-centred-cubic lattice (the corners of a cubic grid, plus an extra point at the centre of each cube).

The advantage of the truncated octahedral voxels over cubes is that the resulting threshold surface will not have any non-manifold edges. For example, 2 diagonally adjacent cubic voxels could share an edge, and that edge would then have 4 adjacent faces, which would cause problems later on. Marching cubes resolves this with its big lookup table of edge cases, but I felt like trying something a bit different.

As a Voronoi tessellation, the truncated octahedra always meet 3 around an edge, so this problem of the non-manifold edges can never occur (yes, ok – cubic voxels are also technically a Voronoi tessellation, but a nasty degenerate one where one of the 3 faces per edge disappears to nothing).

This can be illustrated with a 2d equivalent - A hexagonal tiling (which is the Voronoi diagram of points on a triangular grid) will never have the non-manifold edges that can occur with squares. The second stage of my algorithm takes the stepped approximation of the surface from the first stage, and iteratively pulls its vertices onto the actual isosurface. Here we make use of the gradient of the field, and do a Newton-Raphson iteration, which converges quickly. Because all the vertices are pulled independently, this can be done in parallel.

The advantage of this two-stage approach is that the first stage can be carried out with a coarse grid, as it only needs to capture the essential topological features of the surface, and because it is only a binary check with no interpolation it can be fast.

Then, only after we have ruled out the vast majority of the points, we pull the remaining ones onto the surface to capture the finer details of the shape. We can also even include smoothing or subdivision steps between the 2 stages to improve the quality of the resulting mesh with little extra cost.

So here it is if you want to play with it:

Aether.dll

Aether_Examples.gh

(and the source is all up on GitHub here)

To try this out, put the Aether.dll in your Grasshopper libraries folder and make sure it is unblocked. Then when you open the Grasshopper definition you will be prompted to update the referenced assembly locations, and you should point it to where you just placed the dll. You'll also need Weaverbird installed if you want to do the smoothing or subdivision between steps.

This definition doesn’t do any clean-up around the edges of the grid – so you’ll probably want to either make the grid big enough to leave a gap around your geometry, or trim the result with some clipping planes.

I’ve included implementations of inverse distance weighted fields for curves and points (a.k.a. metaballs), and the mathematically defined implicit surface which approximates the gyroid.

You can find equations for many other nice surface under the Level surfaces section here:

or in the forums of K3dsurf

If you want to have a go at defining your own fields, you’ll also need to include the gradient function. For this I find Wolfram Alpha comes in very handy – you can just plug in Grad(some function of xyz) and get the result. For example: grad(sin x * cos y + sin y * cos z + sin z * cos x)

Bear in mind that this is all work-in-progress - I just put it together yesterday, so there are very likely still some bugs. Any feedback welcome, or just post if you find a nice example.

Hope it is of some use/fun!

Daniel

Thanks to Dave Stasiuk, Will Pearson and Anders Deleuran for helpful conversation around this.

Views: 14305

Comment

Join Grasshopper Comment by Claudia Lu on November 10, 2017 at 11:31am

I downloaded the aether.dll and all the c# files and followed the instruction to relocate the file. However it still doesn't work. When I open the example gh file everything is missing. Any advice on how to fix it? Comment by Marcin Nowak on September 15, 2017 at 3:43am

Is it still working? I can't install it on rhino 5 or 6... Comment by AJ on December 27, 2016 at 6:20am

is this plug still working? or.. hot to install it...

unless there is another way since 2014 to create curve based mesh...

thnx Comment by Jens Pedersen on June 3, 2015 at 6:49am

Quick question, what valuea would you suggest to get the mesh around curves and points? I have scaled my geometry down to the size of your examples, and would assume that by plugin in my curves and points would produce similar results? Comment by Daniel Piker on April 7, 2015 at 12:24pm

Hi Moonbeast. Is it giving some error message? Sometimes the COFF loading causes problems when passing custom types between scripted components like this. Try switching it off in GrasshopperDeveloperSettings, then restarting Rhino. Comment by Moonbeast on April 7, 2015 at 12:19pm

Daniel,

Excellent work, you are changing the game, so many props. I am having issues loading Aether on 9.076, it is not asking for the assembly location. I went and double checked the component in the Manage assemblies and it seems as though it is referencing the proper .dll, of course, also unblocked, any advice for other means of getting it working?

Also, new kangaroo is amazing, killing it Comment by Joris Hoogeboom on March 17, 2015 at 7:32am

This is amazing! Somehow I manage to let it crash rhino very easily (even with small amount of points, 4-5 or so), hard to do anything with it this way. Any idea? Comment by Kim hauer on March 9, 2015 at 2:05pm

Interesting topic! I have been exploring IsoSurfaces using K3dsurf for some time.

I recently Tried a Houdini Demo with also has a Python math engine to create IsoSurface Geometry, but I found it extremely slow. Below are some examples from a site.

http://www.z-way.org/script-and-gizmo/houdini/isosurface/isocubes

The Math is similar to K3dsurf functions, with some function definitions specific to Houdini input format.

I'm curious if a complex IsoFormula: for example,

min( abs( abs( min( min( abs(\$X), abs(\$Y)), abs(\$Z))) -2)* cos( deg(\$PI/4))+ abs( abs( min( min( max( abs(\$X), abs(\$Y)), max( abs(\$X), abs(\$Z))), max( abs(\$Y), abs(\$Z)) ))-2)*sin(deg(\$PI/4))-0.4 , min( abs( abs( min( min( abs(\$X), abs(\$Y)), abs(\$Z)))-2), abs( abs( min( min( max( abs(\$X), abs(\$Y)), max( abs(\$X), abs(\$Z))), max( abs(\$Y), abs(\$Z)) ))-2)) )^2+(max(max(abs(\$X),abs(\$Y)),abs(\$Z))-3.4)^2-0.0225

can simply be copied into a Grasshopper Panel, attached to the remaining Generalized IsoFormula.gh for evaluation? Comment by panhao on March 4, 2015 at 3:05am

Well I Found that an octahedra can be cut into 8*6+6*2  tetrahedrons.Why not use tetrahedrons to polygonising the scalar field?I made one showed below. Comment by panhao on March 4, 2015 at 2:55am

by June Lee

• View All