nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…
D'une durée de 2 jours, vous apprendrez les fondamentaux indispensables pour piloter confortablement et efficacement Grasshopper.
Programme sur demande.
nt to multiply the number of items in the list A, so at the end I will end up with the same number of elements in each lists.
e.g. (for branch 1 in list A I want to have two times the same curve, and the same for the branch 2 and so on )
List A (Data with 88 branches)
{0} N=1
{1} N=1
{2} N=1
{3} N=1...
List B (Data with 88 branches)
{0} N=1
{1} N=2
{2} N=2
{3} N=1...
NEW List A (Data with 88 branches)
{0} N=1
{1} N=2
{2} N=2
{3} N=1...
Any suggestions about how to do this?
Thank you,
Martha
…
by its own tangent vector on the curve... and this happens to the last item. Here's the algorithm:
B0 ----> B1
B1 ----> B2
B2 ----> B3
B3 ----> B4
...
…