Partition Tree

Replies to This Discussion

Permalink Reply by David Stasiuk on July 21, 2015 at 11:08am

Interesting. I wonder what the input structure would look like. A ZUI where the number of inputs reflected the depth of the data structure to be imposed?

This is a rough pass that would look at if you wanted to create a path structure with three indices (you'd define the partition length of indices 1 and 2, and then index 0 would operate as a counter that increments when both index 1 and 2 are at 0):

Something like this?

Attachments:

• SubdividingTree.gh, 15 KB

Permalink Reply by ng5 Alex on July 21, 2015 at 1:49pm

Hello David,

i am not sure why there is a need for the first input. To control the increment renumbering position in the tree paths?

I believe having just the second input indicating each how many branches, an increment in the first path number happens is enough. But maybe i am missing needs you have foreseen, by adding the first input.

cheers

alex

Permalink Reply by ng5 Alex on July 21, 2015 at 7:27pm

spending more time on this i can see that the first input gives more control, ie for cases of uneven first index path partitioning, but also when partitioning and trimming back the tree to an new data structure.

Permalink Reply by Arthur Mamou-Mani on August 6, 2015 at 7:54am

Hi David (Stasiuk) :)

Thank you so much for this! Would it be difficult to get the I0 and I1 input to accept a list of integers instead of a single one?

I need to partition my tree with different different amounts of sub-branches and struggling to do this with strings. I've got the list of path that I need and the tree - I just don't know how to put them together :(

In a way I would need to custom trim the tree but at different location of the tree...argh. 

I hope you can help,

Many thanks,

Arthur

Permalink Reply by Congzheng ZOU on August 31, 2018 at 3:45am

I use pathmapper. It works.

{0;A;B} - {0;B;A}