a seed, and instead creating a pattern where each color has a seed/control slider for each row? For example, row 1: brown 2, tan 6, yellow 7, purple 3, repeat. row 2: brown 6, tan 1, yellow 4, purple 10, repeat. row 3: yellow 5, purple 1, brown 3, tan 10, repeat. row 4: purple 2, brown 7, tan 3, yellow 4, repeat. Then repeat that sequence up the wall? For each color, the number in the sequence should be adjustable.
Thank you again for your help!…
points 0, X-1, (2*x)-1, (3*X)-1, (4*X)-1, (5*X)-1 and then
1, X, (2*x), (3*X), (4*X), (5*X)
2, X+1, (2*x)+1, (3*X)+1, (4*X)+1, (5*X)+1
and so on till
5, X+4, (2*x)+4, (3*X)+4, (4*X)+4, (5*X)+4
How can I do this best?
Thanks,
Niels…
3 of them have an area of 3 m^2
3 of them have an area of 6 m^2
3 of them have an area of 9 m^2
can I create a data tree with 3 branches sorted by area?
Thank you!…
;-2;-1;0;1;2;3) and beside that i don't want to have 0 as a result.
So at the End I would like to have only 6 numbers: -3;-2;-1;1;2;3
I already came to an result with integer numbers but it actually only rounded up the random results. when one of the results was -0.473 it ended up as 0.
I'm sure it's pretty easy to solve, I'm just missing something.
thx for help…
rve
10 curve
11 curve
12 curve
13 curve
...and I'd like to rearrange the order in which the curve are listed, to something like this:
{0,0,0}
0 curve
1 curve
8 curve
9 curve
10 curve
11 curve
2 curve
3 curve
4 curve
5 curve
12 curve
13 curve
6 curve
7 curve
I hope this makes sense.
Thank in advance for any advice,
John…
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