Data Tree Management

Hey David,

I have a question why certain data tree matching does not happen...for instance:

(3) circle center points from (3) grafted circles:
     {0;0}(1)
     {0;1}(1)
     {0;2}(1)

Those (3) circles are then each copied vertically 3x

(10) division points of those 3 copies of those (3) original crvs

----------------------------------------------------------------------------------------
When trying to make a 2pt Vector, how come the center points, that are in a lower branch level, don't get distributed to each "limb" of itself. It seems as though this happens when the branch has (1) "limb" but not multiple.

Is there a specific reason? Just wondering because it sure would save time not having to duplicate the center points in order to match the division points structure!

Replies to This Discussion

Permalink Reply by David Rutten on October 9, 2010 at 3:48am

Well, it is working the way it is supposed to be working. I'm just not sure if the way it's supposed to be working is the best way.

The problem is that when data is supplied to a component, it is simply handled in a sequential fashion. There is no smarts in there that will try and figure out which branch in data-tree A best matches which branch in data-tree B.

In this specific case, you're providing two data trees with radically different topologies. One has three branches of the {A;B} kind, the other has nine branches of the {A;B;C} kind. So the first branch in tree A is matched up with the first branch in tree B. Then the second branch in A is matched up with the second in in B, and so on and so forth. After three of these, tree A runs out of branches so it keeps on recycling the last one.

What you need to do is either complexify the first tree so it has nine branches of the {A;B;C} persuasion, or simplify the second tree. I chose to simplify as it's easier:

One of the things I can do to make this easier is to add more data matching algorithms. The ones that are in there now have not been updated since data-trees came onto the scene so they are fairly antiquated. Another thing I could do is supply more components that do these kinds of tree modifications automatically, or perhaps add additional features to the Path Mapper or something. If you have a suggestion I'd love to hear it.

--
David Rutten
david@mcneel.com
Poprad, Slovakia

Permalink Reply by Evert Amador on October 9, 2010 at 6:49am

Hi David,

I'm not very good to with the path mapper so for me a component which took 2 or more data trees with different matching algorithms options to choose from would be very handy.

Cheers

Evert

RSS