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.
…
ases where you have angled shades and the component is doing trigonometry to figure out how close the blinds could be to the glass without touching. I just re-wrote the code so that, now you cannot have the blinds closer to the glass than half of the blind slat depth, which seems to be the limit of what E+ will tolerate.
Also, E+ does not like it when you input blinds that are perfectly at 90 degrees so I changed the component to automatically write out shades at 89 degrees when you connect up 90.
Using the Shade geometry as context worked perfectly for me and I am not sure what was wrong in your situation.
See your working file attached.
-Chris…
سلام آقای جان بیلی کاوه اشکوه هستم اپراتور سی ان سی از ایران وطراح دکوراسیون داخلی اگر ممکن هستش فایل اصلی میزcosinosa baram mail konid adressmail man hast
(kavehoshkooh2290@gmail.com)بسیار متشکرم
Added by kavehoshkooh at 3:25pm on September 11, 2015