algorithmic modeling for Rhino
Varying mesh refinement parameters within a surface growth model inspired by the work of Nervous System (1), Andy Lomas (2), and deskriptiv (3).
More info and source code @ http://spatialslur.com/differential-growth-3/
Would you consider sharing the Grasshopper definition of this study http://spatialslur.com/differential-growth-2-2/ ? Thank you.
I've had some luck constraining/biasing the growth with volumetric information - a scalar field representing signed distance to a boundary mesh for example.
Yeah I think Andy is the patient zero for this one. In any case, feel free to build upon the C# implementation.
Regarding vertex collisions, a KdTree probably won't give the performance boost you'd expect in this case. KdTrees are quick to search but relatively slow to build (each insertion is O(log n)) and because the point set is dynamic, you'd need to rebuild every iteration. The simulation is better suited to spatial hashing or even a simple uniform grid - especially since collision objects are all the same size.
its pretty much amazing, how this type of algorithms make the rounds.
this is the project that we did in Phyton last Semester at University of Stuttgart.
It lacks very much the KD-Tree implementation and so the Maximum Number of interacting cells was limited to smth like 74k, taking literally hours to compute.
Wanted to make a C# version of it now for speedup-purposes, but stumbled on this post here and was very amazed.
If its ok for you, ill try to implement some more functions ...
drop it like its hot Dave!
Also a shout out to the clever folks involved in this discussion
© 2023 Created by Scott Davidson. Powered by
You need to be a member of Grasshopper to add comments!