TREE B
{0} n=1 {0;1} n=4
{1} n=1 {0;4} n=4
{2} n=1 {1;1} n=4
{1;2} n=4
{1;3} n=4
{1;4} n=4
{2;1} n=2
{2;2} n=4
{2;3} n=4
{2;4} n=4
Both trees are generated from sliders, so could have any number of branches, although they are tied together. Tree A is a set of division points on a line, Tree B is a set of intersections from lines generated radially from the first (in this case three) points. I am trying to perform a "closest point" operation between the first tree and the second tree-- only, I do not want them to cross list, or long or short list. I want the {0} point to operate with those entries in the 2nd tree that start with {0,x}. So it would look like
{0} --> closest point with {0;1},{0;4}
{1} --> closest point with {1;1},{1,2},{1,3},{1,4} etc
I cannot figure out how this works. What I am visually trying to do is cast rays from a string of points so that they stop when they encounter another curve. I am having trouble picking through the intersection events to get what I want. Check the attached files for some clarity. THANK YOU…
Added by Joshua Jordan at 12:06am on February 5, 2012
the one-but-last list [4]. After running out of the n- items avalaible it should continue with the second item of list 0 and so on for all items on all the lists.
Intput, six lists of 30 items each
[0] (n=30)
[1] (n=30)
[2] (n=30)
[3] (n=30)
[4] (n=30)
[5] (n=30)
Output, 18 lists of 10 items each
[0],i=0;[5],i=4; [4],i=7;...
[0],i=1;[5],i=5; [4],i=8;...
...
[5],i=1;[4],i=5; [3],i=0;...
I thought perhaps the weave component or the relative tree item component but didn't manage to figure out how to compose the mask. I couldn't find much on how to use these. I guess it should wrap the lists, but not the items.
Any help would be greatly appreciated.…
Added by Thorsten Lang at 2:27am on January 24, 2011