algorithmic modeling for Rhino
An experiment with adaptive sphere packing on a surface with the help of Rhinocommon's RTree class.
A new sphere is added to the population if the average pressure felt by the existing spheres falls below a given threshold. Similarly, if the average pressure exceeds a second higher threshold a sphere is removed.
More @
http://spatial-slur.blogspot.co.uk/2013/10/pack-attack.html
Tags:
Comment
Also, for such a trivial case, one may use delaunay triangulation mesh and search for neighbors via vertices connections. Nevertheless, your approach is probably similar in terms of computational cost, have you used the RTree which is already implemented in rhinocommon ? (I could not get it to work). If so, mind you share a bit of the code ?
Yeah you start to really see the difference when the population size exceed 1000 or so.
Still looks to be a lot cheaper computationally than trying to solve for every sphere's relationship to every other one!
Many thanks.
David -
That's right. At the end of each step the tree is cleared and the spheres are re-inserted at their new positions. I'd imagine that this comes with quite a bit of overhead.
Fantastic work. So you're using the rTree to isolate neighbors for calculating pressure effects? Are you re-registering the rTree with each timestep?
nice
© 2021 Created by Scott Davidson. Powered by
You need to be a member of Grasshopper to add comments!
Join Grasshopper