Mick van Olst
Mick van Olst
About Me
Connect
LOCATION
Not Specified
WEBSITE
Houdini Skills
Availability
Not Specified
Recent Forum Posts
Sort points with minimal travel distance between polygons April 27, 2020, 5:25 a.m.
Hi there,
I'm trying to figure out how to sort points in a way that creates the smallest distance between point numbers spanning multiple polygons.
For instance, say you'd have a polygon and you move along the point numbers, then at the end of the polygon, the next point number should be at the nearest polygon endpoint.
I'm using Houdini to plot drawings, and this optimization would greatly reduce the time needed for the arm to move around.
So far I've been able to optimize for simple drawings using the sort sop, or with UVs, but with more complex ones where there are triangulated meshes etc. this really needs a more intelligent bit of processing.
Does anyone have any tips on how I could approach this? Probably in VEX with point wrangling?
I'm trying to figure out how to sort points in a way that creates the smallest distance between point numbers spanning multiple polygons.
For instance, say you'd have a polygon and you move along the point numbers, then at the end of the polygon, the next point number should be at the nearest polygon endpoint.
I'm using Houdini to plot drawings, and this optimization would greatly reduce the time needed for the arm to move around.
So far I've been able to optimize for simple drawings using the sort sop, or with UVs, but with more complex ones where there are triangulated meshes etc. this really needs a more intelligent bit of processing.
Does anyone have any tips on how I could approach this? Probably in VEX with point wrangling?