etc.
Group 2 - 1, 6, 11, 16, 21 etc.
Group 3 - 2, 7, 12, 17, 22 etc.
Group 4 - 3, 8, 13, 18, 23 etc.
Group 5 - 4, 9, 14, 19, 24 etc. "
except in data, the branches start at 0, so 'group 1' is branch 0
as for the order of your points, that depends on the input prior sorting...
yrs …
I have this :
list 3 : 0 1 2 3 4 5 6
list 2 : 0 1 2 3 4 5 6
list 1 : 0 1 2 3 4 5 6
list 0 : 0 1 2 3 4 5 6
and I want to group the points of index 0 in a branch, the points of index 1 in another branch and so on.
I attached a file in which I generated the points.
Thank you in advance for your help !
Regards
Red…
Hi Naoki! Use list item to extract 2 and 3 from original list. Cull item 2 and 3 from original list and then list insert (insert your list item in 4 and 5 indexes). Hope helps. Bests.
for instance
if i have a bunch of pionts, say "4", i want the connection of them without getting connections within the same 2 points.
the answer should be (4X3) / (1X2).
another example could be:
index 3 value 6
index 4 value 6
index 5 value 6
flipped and branched:
branch 6 index 0 value 3
branch 6 index 1 value 4
branch 6 index 2 value 5
Added by Ante Ljubas at 12:50pm on October 22, 2010
0, 5, 10, 15, 20
1, 6, 11, 16, 21
2, 7, 12, 17, 22
3, 8, 13, 18, 23
4, 9, 14, 19, 24
and if i'm here is because i'm not able... :)
can you help me?
thank you
…
shift. I realize I can use 'replace branch' but I do not have an available mask to utilize. I have simplified the problem to its simplest form so my question is understandable, however, the tree I am trying perform this operation on is a much larger 3 digit path address.
{1;3;2}
{2;3;4}
{3;5;4}
{4;3;7}
Change the above list to the list below.
{0;3;2}
{1;3;4}
{2;5:4}
{3;3;7}
I wish for a more robust arsenal of branch manipulation components. Most of the things I need to do are possible with the existing components, however, many operations take several components to perform even simple manipulations. Since branch/path manipulation is so integral to using GH successfully, it seems the GH community would be well served by enhancing the available path manipulation components.
Thanks,
Stan
…