I can’t find a definitive answer to this so I need to ask. I’m looking for the most efficient way to sort the below list. I have three curves divided into points. I need every second point in the middle curve to connect to the upper and lower diagonal points of the curve to the left and right (as drawn with separate curves).
Is partitioning the lists and then shifting the central one the best way to go?
Many thanks in advance
ListManipulation.gh (6.1 KB)