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?…
tries, of different types, both annotation objects and curves, won't it be slow to iterate through all these objects for each rectangle?
I use 0.6.X but i'm soon making the shift to 0.7.X…
ve is most impacted by the characteristics of the vector field...If accuracy is not so important, you can use the curve re-sampling components to create a smoothe curve.…
e able to loft them correctly. picked a point on the curve, decomposed points, selected x-output. but how to arrange the curves now from -n to +n?
cause my list looks like: -90,-80,-70,10,20,30,-60,-50,-40,40...
im so sorry but i have no idea, and unfortunately no time :(
thx in advance
michael…