I am trying to sort a list of curves into 3 different groups.
I would like to do this with a loop. My idea is that the loop would find the intersections from the highest curve and it would use that data to determine the group.
The output that is needed is a data tree that has 3 branches with curves that are on top of each other.
Is there also a way not to input the number of loops but let the loop figure it out (until there is no more curves to to act upon)
if there is a different way of doing this please do share, but I still would like to understand how to do this with a loop
Thanks a lot in advance.
Soritng curves.gh (11.5 KB)