g these times itself). If it works on selection alone, it would probably implement faster.
Theoretically, does this mean the total solving time of the definition is the 'chain of components' that takes the longest time? In the picture above, it would be the chain consisting 'point-curve-divideDistance'?
Because that still adds up only to 97%, I am assuming the Point and Slider component start solving in parallel, and the two Divide components also start solving in parallel?…
t it is rounded to 25, 100, 75. I've figured out the rounding portion, but when I plug the resulting list back into the custom preview, it doesn't recognize the data. I'm guessing it is because my rounded list is in curly brackets, whereas the unrounded data straight from the image sampler is not. How can I process this to remove the curly brackets?
Thanks,
Ryan
…
Added by Ryan Dirks at 5:20pm on September 18, 2014
ng long in the x axis and three in the y and they don't all intersect each other... I wrote a script to Boolean difference them but its not working like i want it to . I included a rhino result that id like to achieve in the file. THX -ethan
heres the script:
import rhinoscriptsyntax as rs
b1 = []for i in range(b1L): b1.append (x)print b1bb= len(b1)print bbb2 = []for j in range(b2L): b2.append (y)print b2bc = len(b2)print bc
def bool ():....for i in range (bb):........for j in range(bc):............a = rs.BooleanDifference( b1,b2, False).....return (a) a = bool ()…
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.
…