FORE MeshMachine (rather better) or after
BTW: For a mesh with 7M points ... well... you'll need some proper CPU to deal in a reasonable amount of time (what about a Xeon E5 1630 V3?).
Alternatively find a friend who knows very well Modo ... and see first hand what the US Movie Industry is all about.…
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?…
components are essential.
I would love to see GH in "pure" mode - no components which can be made simply with other components (such as - no a2 (square) and a3 (cubical) - only "a powered by n")
…
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
…
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.