More efficiency method for Intersection of lines?

Hi,
I’m able to get intersections of all cross diagonal lines by using Geometry.IntersectAll but seems run slow if i increase the amount of lines. Is there any better way that can make the program run faster? Thanks

InterectiontLogic.dyn (10.0 KB)
CrossDiagonalFillBySpacing.dyf (49.3 KB)

Curve.IntersectAll in BimorphNodes:

Curve-IntersectsAll-Performance-Benchmarking-Test-Results

There’s more info here if you want to know more about the node.

3 Likes