I feel like I’m going crazy. I thought the Closest Point component respected data tree structures?
Meaning, if I have a P input tree with say 1 point per branch and then a C input tree with 3 points per branch.
Shouldn’t the result be the closest single point in C for each P item within each matching branch structure for C/P?
Please see the attached screenshot and gh file for more information.
Currently lines are being created across the data tree structure, disregarding the fact that, for example, path {0;9} has no input match in C input and therefore (in my mind) should return a null closest point.
It appears instead that it finds the closest point for each branch in the data tree instead of searching within the P path context only.
If I compare one path at a time it works as expected but does not work with multiple paths simultaneously?
Your trees don’t have the same number of branches. This is what counts, and what has always mattered. The branches numbers don’t matter (except for some tree components with the input as tree).
You need to reinstate empty branches in the Cloud tree to match all your Point branches.
Thanks @magicteddy , let me give that a go. For some reason I thought GH worked across paths without needing empty branch/structure matching but I must just be overtired and imagining things.
Not in this case as I have the data grouped in a way where point in A {0;0} should only be searching for cloud points {0;0} which could be a list of 0-10 points for example.
