Hi everybody.
I have a problem I can't solve. I need to sort a given number of points in one direction.
The plan is to attach a curve to the point.
Build curve from points
22428 4 1- onkel_eilert
- Member
- 14 posts
- Joined: Feb. 2010
- Offline
- kuba
- Member
- 345 posts
- Joined:
- Offline
- onkel_eilert
- Member
- 14 posts
- Joined: Feb. 2010
- Offline
- kuba
- Member
- 345 posts
- Joined:
- Offline
Have a look at the ‘join curves by proximity’ HDA at this website http://www.kubaroth.com/hda/ [kubaroth.com]
There is a pytony sop inside which does exactly what you are looking for. Instead of sorting prims you need to do a loop over points and their neighbours (excluding previous point) and assign lowest possible value of your custom point attribute. This way you will walk through all the points by jumping between closest neighbours.
Next use sort sop to reorder point numbers and connect them with an add sop.
The tricky part is to prepare the order of the points. This solution is pretty slow considering complex situation, so i'm waiting for a vex solution to tackle the problem
Kuba
There is a pytony sop inside which does exactly what you are looking for. Instead of sorting prims you need to do a loop over points and their neighbours (excluding previous point) and assign lowest possible value of your custom point attribute. This way you will walk through all the points by jumping between closest neighbours.
Next use sort sop to reorder point numbers and connect them with an add sop.
The tricky part is to prepare the order of the points. This solution is pretty slow considering complex situation, so i'm waiting for a vex solution to tackle the problem
Kuba
- onkel_eilert
- Member
- 14 posts
- Joined: Feb. 2010
- Offline
-
- Quick Links