@anon39580149
I assumed drawing the data tree would be more understandable. The indexes don’t matter; only the paths (branches).
If I take the first branch of the BLDG HEIGHTS data tree and test its 12 points for inclusion within the 92 curves of FFE GROUPS, I get a list of 0’s, 1’s, and 2’s.
This data tree is:
{0;0} N=x
{0;1} N=x
{0;2} N=x
In my understanding, the above data tree is a nested data tree containing three sub branches on a path. I need 10 paths (each with 3 sub branches) which are the ten branches of the BLDG HEIGHTS Data Tree.
@amouzakopoulos
Grafting the input of the ‘C’ on ‘Curves in Polylines’ is necessary, but doesn’t seem to resolve my goal when I feed in the data tree rather than one branch.
Hopefully this is understandable and thank you.
i just try to understand
if you match index between buildings and surfaces can that help you to find what you need?
0’s,1’s & 2’s indicate inclusion. Where 0 indicated that the item is outside (false) 1 is inside (true) and 2 is on not curve (true).
@amouzakopoulos
This is exactly right. These results (0’s, 1’s, and 2’s) will comprise the nested data tree.
maybe what you need is a trim tree after you graft the curves to return back to the original state.
seems that your points are in a tree as well. On your original file, I tried to flatten the points and graft the curves and then trim the tree. I’m not sure if you’re looking for this data matching but it seems to work
This sounds promising. I can’t reproduce your results though. Can you post a screenshot if possible? thanks!
I am not sure how this works as I can’t reproduce it. Flattening the Data Tree of points causes the structure to be lost of what I am attempting to test.
If I used ‘Member Index’ and somehow found the indices of the branches before flattening, this could work; however, it seems overly complex.
I’m now doubting as to whether this data tree is achievable. Attached is my fail.
A hack could be to use an Anemone Loop to go through the points branch by branch and record the output.
