I am trying to figure out how to calculate the overlapping region between two closed curves. I tried converting one of the curves into Brep and split it with the other and it works well. However, when dealing with many of them, it just eats up to much computational resources, so I am trying to find if there is better way of doing this.
I’m not sure if it’s exposed in vanilla Grasshopper, but sounds like you’re looking for the
Curve.CreateBooleanIntersection method. See the second file here for an example:
Awesome. I’ll give it a try. Thanks,
My solution by using Grasshopper
Oh, right. it is new to v7. It is much better but still not fast enough. Any novel method of doing this faster?