I have a data tree of anything, curves, points, even numbers or texts.
All branches are the same length.
I am trying to reconstruct it diagonally with native components.
The GH is my attempt. As you can see, this naive but intuitive method can only solve data tree of points.
Very interesting problem, but unfortunately I have to go in a few minutes.
As you’ll see I have solved only half of the task… Still it might give you some ideas diagonal_sort.gh (7.9 KB)
Hi @Quan_Li , just out of curiosity, how many clusters do you have?
I see that you have them for everything and probably this code also becomes cluster.