Hi Rasmus,
This looks like Tapeworm to me, but you might be interested in testing my Phasma definition.
I'll releasse v0.9.9b with mesh relaxation tomorow I hope.
Fred.
this target list:
(a1, b1, c1, d1)
(a2, b2, c2, d2)
(a3, b3, c3, d3)
....
What I want to do is injecting one more value (arbitrary angle in my case) to each point before I cull many of them - so that each point brings its angle data along.
Any hep would be greatly appreciated. TIA
…
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?…