Hi! I am hoping someone could help me understand the basic logic of intersections. I have 7 sets of surfaces and curves organized into 2 lists. Lets call them List S(for surface) and List C(for curve). Each list contains 7 branches. I want to intersect all the surfaces in branch 1 of List S with all the curves in branch 1 of List C, all the surfaces in branch 2 of List S with all the curves in branch 2 of List C and so on.
The problem is that it seems the Brep to Curve (BCX) component will take item 1 in List S-branch 1 and intersect it with item 1 in List C-branch 1, then item 2 in List S-branch 1 and intersect it with item 2 in List C-branch 1 and so on, rather than every item in the branch all at once.
How do I manipulate the lists so that I can intersect all the items in one branch to all the items in the matching branch?
I need to keep the 7 branches structure for the script downstream. I am aware I can graft 1 of the lists and flatten the other to apply EVERY SINGLE item to each of the items in the other list, and get a ton of null intersections, but this seems inelegant and does add quite a lot of processing time as I do this many times in my script.
I’ve attached a simplified version of the script. Let me know what I am missing (36.0 KB)
example.gh (36.0 KB)