I don’t know if I’m expressing it right, but I need to perform an operation between groups of curves:

I want to find the intersection of each curve in a list with the equivalent curve in the next list. To me it resembles the ‘shift list’ component just with branches. Can somebody pls help me with that? (in the example, I only have three groups of curves but in reality I have many more and I need each group to intersect with the next)

I hope that makes sense…

shift list.gh (15.0 KB)

here is what I would do If I had just a list of curves instead of a tree: