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
…
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 …
So the distance between each pair of closest points must be exactly 5, 7, or 15? How about the distance between a point and it's 2nd closest neighbour? 3rd closest? ...
Added by David Rutten at 9:41am on November 10, 2017
t 2^15 are being listed. Later I will use this info to cull;
all instances where important nodes are not present,
geometric unstable trusses using Grubler's criterion,
the remainder will go to FEM for further analysis,
I can use this method but i require to separate each binary boolean
so they are stored separately like so;
{0} (0) 0 (1) 0 (2) 0 (3) 0 (4) 0 . . . . . . . . (15) 0
{1} (0) 1 (1) 0 (2) 0 (3) 0 (4) 0 . . . . . . . . (15) 0
{2} (0) 0 (1) 1 (2) 0 (3) 0 (4) 0 . . . . . . . . (15) 0 (I know there must be an easier scripted way how to do it) or else is there a way to decompose them directly from the method you sent me using standard Grasshopper components?. Any method would work.
Best,
Kane…