I have a data tree problem which seemed to be quite simple but I couldn’t solve it so far.
First of all: It is a data tree organizing question, the points on lines is just a simple example to visualize the problem. (this question originated from a much more complex definition, which I didn’t want to post, as it is not important for solving it, so I settled up a basic example)
I have a flattened data tree (had to because of a Karamba line-line intersection component), and I would like to organize the output based on their original branches.
If the tree is not flattened, then it is very simple with a path mapper component (also incuded in the definition). But I can’t solve it with the flattened data.
I tried with Tree branch and ranges but it doesn’t work the way I expected. (I am not sure if it is possible to use the complonent like this). Also experimented with Split tree, but still no universal solution.
Any recommendations how to solve this?
Data tree_question.gh (12.9 KB)