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.
…
سلام آقای جان بیلی کاوه اشکوه هستم اپراتور سی ان سی از ایران وطراح دکوراسیون داخلی اگر ممکن هستش فایل اصلی میزcosinosa baram mail konid adressmail man hast
(kavehoshkooh2290@gmail.com)بسیار متشکرم
Added by kavehoshkooh at 3:25pm on September 11, 2015
on for curves, if you make an algorithm that dynamically defines the possition of the controlpoints for NURBS curves as a function of the parameteres in F(t, a1,...,b1,...,c1,...)= x(t, a1, a2...)+y(t, b1, b2...)+ z(t, c1, c2...) or F(x, a, b ,c...)?
…
ide into 80 branches, and 80 outputs of explode and 80 dispatches - its my nightmare. Is there any way to do this with parametric Number of brunches? …