papicrunch Posted December 10, 2011 Share Posted December 10, 2011 hello, I want to know if there are a faster or better way do this stuff : define a start point then find the nearpoint in a pointcloud then join them together and next repeat the same stuff with le last point a "x" number of time. For the moment I use a foreach loop with group and degroup system. With that system there are two problems : speed with hight number of iteration, and if the number of repeat or "the treshold raduis"(see in the hip file) are too high the foreach node "break". Thank you, Thomas Quote Link to comment Share on other sites More sharing options...
3dbeing Posted December 13, 2011 Share Posted December 13, 2011 Maybe you could try the sop solver and use time as your iterator.. Quote Link to comment Share on other sites More sharing options...
Macha Posted December 14, 2011 Share Posted December 14, 2011 (edited) Uhmmm, here is an untested idea: In a sop solver: Make a point P and a pointcloud PC. Find the nearest point in PC to P. Move P along the vector to that point. Delete the visited point. Repeat. Then draw a trail from this. Another way is with Python. I've tried this before and it can be very fast indeed if you use the right libraries (can't remember which one but it was related to graphs) Edited December 14, 2011 by Macha Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.