MJGaiser Posted January 26, 2017 Share Posted January 26, 2017 I need to create a vex function that given a position, and a max distance, it will return the prim_id & prim_uv of all the primitive (curves) within that max distance. Similar to what we can do with a pcloud, but with the closest position on the given curves, even if that closest position is not at a point. I am trying to use a while loop with an xyzdist lookup inside, but I am having trouble removing the found curves from the group in subsequent iterations. I want to add all the potential curves to a group and each time one of them is found, remove it from the group and run the xyzdist lookup again until it cannot find anymore curves. Does anyone have any idea how to accomplish this? Thanks! 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.