53 → 53 → 63 → 74 → 74 → 84 → 9
As you can see from the above list the connection sequence comes in waves of three, where each group of similar indices on the left is associated with a group of three incrementing indices on the right.
Some combination of Series components will probably generate this list, but it'll only work for the first ring, the second one will need a different connection pattern. It is perhaps better to just encode the integer pairs by hand. But then you cannot change your mind about the number of sides later.…
Added by David Rutten at 10:39am on October 21, 2015
Branch Address in the form {0;1;2;3;4;5;6;7;8;9;.......;N}
Try Grafting the input (I) Create Path by right clicking on it and selecting graft from the context menu…
in the desired order.
0 = 0
1 = 1
2 = 6
3 = 7
4 = 8
5 = 9
6 = 12
7 = 13
8 = 2
9 = 3
10 = 4
11 = 5
12 = 10
13 = 11
Where the first number is the index and the second number is the actual sorting key. Then you sort these keys while sorting your curves in parallel using the A input of the Sort component.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
E.g.:
0 2 (A) = 2
1 2+4 (A+B) = 6 (AB)
2 6+4 (AB+C) = 10 (ABC)
3 10+6 (ABC+D) = 16 (ABCD)
etc.
Into a new list numbers:
{2,6,10,16, etc} that adding the previous number with the next number.
Thanks,
daniel
…
ow do you sort data trees with distinctive number of list items in each branch?
In this example, there are 161 branches with three distinctive number of list items, 3, 4, and 5. I want to know if there is another way to sort out this data tree into this way: 3 vertices {0;0}, {0;1}, {0;2],...4 vertices {1;0}, {1;1}, {1;2},... 5 vertices {2;0}, {2;1}, {2;2},...
2. Is there a way to sort our surfaces based on number of distinctive list items automatically? For example, if there are surfaces with 3, 4, 5, 6, and 7 vertices, I want to make five branches with the same number of vertices automatically.
I hope my questions make sense...
Thank you!
Dongyeop …
Added by Dongyeop Lee at 12:14pm on October 3, 2016