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?…
Hi Chris,
Quick response!!
Attached. There are a lot of things in there ...
I'm suspecting it can be a memory issue. I'm running at 84%, which is not critical, but ...
-A.
nologically label them (there are currently 65 points and this is labelled as in the file i've attached). However, what i'm actually after is to reformat these points into an x and y style grid.(a1, a2, a3, a4, a5)(b1, b2, b3, b4, b5)(c1, c2, c3, c4, c5)(d1, d2, d3, d4, d5) etc.Any ideas/help how this can be made possible would be great.Thanks in advance…
xtract A1, A2, B1, B2 as one set, A2, A3, B2, B3 as the second set, A3, A4, B3, B4...etc. as the third set and so on. How can I get about doing this?
Any help would be much appreciated!
Thanks,
Ben…