Medial Packing

Comment

Comment by Mateusz Zwierzycki on October 8, 2013 at 11:41am

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 ?

Comment by David Reeves on October 8, 2013 at 6:55am

Yeah you start to really see the difference when the population size exceed 1000 or so.

Comment by David Stasiuk on October 8, 2013 at 12:36am

Still looks to be a lot cheaper computationally than trying to solve for every sphere's relationship to every other one!

Comment by David Reeves on October 7, 2013 at 1:40pm

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.

Comment by David Stasiuk on October 7, 2013 at 1:50am

Fantastic work.  So you're using the rTree to isolate neighbors for calculating pressure effects? Are you re-registering the rTree with each timestep?

Comment by 筑梦NARUTO on October 6, 2013 at 9:39pm

nice

• ‹ Previous
• 1
• 2
• Next ›
• Page