Hi,
this seems like quite a complex procedure (though I guess you could approximate the results with a non-automated result, by eye-balling it)
Do you JUST want to make a shape that looks like the one in the pic, or do you want to create a script that recreates the whole procedure?
If itās the first case, I would say itās very easy
If itās the second, It looks to me as something quite complicated. which would probably require coding.
This is the first case,(rough approximation)
It doesnāt work with points, itās much less āorganicā than the process they describe and it doesnāt bulge in the center. But itās a 20 min ācheapā alternative to months of coding. slime.gh (26.5 KB)
Hello Miguel,
I have tried Kangaroo since this is a form based on surface tension but I am still having trouble creating a script that acts like a stretchy gum/plastic.
Hello Aris,
I am more interested in the form, less so the recreation of the fabrication process. The idea is that this would turn into some grand air traffic control tower for my studio project.
Oh and in the end, well it seems ambitious at the moment, I would like to create this form using modular concrete panels. A set to connect the building to the floor, a set for the middle shaft, and one to connect the building to the sky. Iām not sure if I am explaining it in the best way but modules that have rotational symmetry that twist at the same rate.
It requires more work and Iām lazy!
What they showed is very sophisticated. What I made is a quick solution.
If you want a highly organic form you are not going to avoid hard workā¦
This version uses random points and Shortest Walk to generate the base pattern of peripheral points, then copies those points up twice with separate controls for height, center point of scaling and rotation, and scale and rotation (+/-) values. As usual, Loft options and the Random āSeedā (āSā input) will alter the results.
This is the essence of the Shortest Walk portion of the code above. The Shortest Walk āWā output is a list of polylines from each random point to the Avr point. There are many duplicate segments since shorter paths are āsub curvesā of the longer paths. I was only interested in the outermost end points so I didnāt bother trying to eliminate the duplicate segments, I just used Cull Duplicates with the āCull Allā option to ignore all the Disc points except the outer ones, which were unique. The purple group then uses AlongCrv to sort those points using a circle as a reference, as you can see by the sequence of point numbers.