branches in each A's list of B's, or remove its ends etcso that if I want to remove the last B in every A{0;1},{0;2},{0;3},{0;4},{0;5},{0;6}{1;1},{1;2},{1;3},{1;4}{2;1},{2;2},{2;3},{2;4},{2;5}would become{0;1},{0;2},{0;3},{0;4},{0;5}
{1;1},{1;2},{1;3}
{2;1},{2;2},{2;3},{2;4}I guess the question is do I need to figure out the cull pattern- each B may have different lengths...…
a specific domain, for example:
0.) 0 to 1 -----> 11 random values from 0 to 1 (0.245,0.678,0.36,0.78,.28,0.18........)
1.) 1 to 2 -----> 11 random values from 1 to 2 (1.26,1.36,1.01,1.68,1.26,1.96.........)
3.) 2 to 3 -----> 11 random values from 2 to 3 (2.96,2.45,2.78,2.56,2.98,2.10..........)
4.) 3 to 4 and so on where I have a data set containing 11 paths with 11 values and the values fall within the specific domain.
Like my post above I have the correct path but I need to feed it the correct seed to get different values for each number. I tried grafting a series similar to the last post but it scrambles my data. Thanks so much for the help!
…
Is it like this:
If a beam is connected from nod 0 to 1 and from 1 to 4. Another from 2 to 3 and from 3 to 5.
Node 1 and 3 have the same coordinates, but are they rigidly connected or not?
ches it with the first branch in Tree B (and then the first branch in Tree C if more than two trees are involved).
I'm planning to add better branch matching logic, but I'm not going to touch it until I have a good idea about what's needed and how it can be accomplished without breaking existing files.
So, the branch "address" is only used to sort the branches in a single tree. Thus, a tree with the following branches is always sorted in the exact same way:
{0;0}
{0;1}
{0;2}
{0;3;0}
{0;3;1}
{1;6}
If you have another tree with different branches:
{0}
{1}
{2}
{3}
{4}
{5}
Then the matching will be:
{0;0} -> {0}
{0;1} -> {1}
{0;2} -> {2}
{0;3;0} -> {3}
{0;3;1} -> {4}
{1;6} -> {5}
As long as people adhere to your advice: "it is best for the addresses of each tree branch to be in the same format", there will be no problem. But it is at the moment extremely difficult to perform complex matchings.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 9:25am on August 11, 2010