Is there a computationally faster approach to finding the boolean intersection of curves in a compiled component? I’m currently using Rhino.Geometry.Curve.CreateBooleanUnion, but am surprised how slow the compute time is.
1 Like
Have you found a solution? I’d be interested in that, too.
Any chance we can see what you consider slow? That is, how can we reproduce slow here?
– Dale