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?…
ius, like the image below. I have a string with all of the 8 radii in a group of data. I was using the Divide Surface command, but there are two problems. First, the resulting points have a tree structure shown in the screenshot below, with {8; 2; 3}. How do I assign radius so that the six holes on the same panel has the same radius? The second problem is, the divide surface command generates points along the edges, too, where I don’t need any holes. How can I get rid of them?
…