;-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…
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!…
{4}-0;3
{5}-6;7
{6}-5;7
{7}-5;6
Here it can be shown that there are two subgraphs containing 0,1,2,3,4 and 5,6,7. How can I use spiderweb (either using scripting or the components) to give me this result when I have many more vertices??
Thanks,
Sam…
What are B and C supposed to be? I mean, they have to resolve to actual numbers.
So given the tree:
{0} [0;1;2;3]
{1} [0;1;2;3]
{2} [0;1;2;3]
{3} [0;1;2;3]
What is it you're after?
Added by David Rutten at 8:59am on October 21, 2017
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!…
rated by "<" symbols. Examples: "2<10", "2<4<10", "Pow(2, 1)<5*Sin(3)<10".
The entered text contains 2 or 3 segments separated by two or more consecutive dots. Examples "2..10", "2..4..10", "Pow(2, 1)....5*Sin(3)..10".
If only two segments are provided, then the initial value will be the same as the minimum value. If a bounds number or a default value is written as a simple number, then the number of decimal places will be harvested. I.e. "2..4..10" is not the same as "2..4..10.00" as the former will result in an integer slider and the latter in a slider with two decimal places.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 10:08am on February 15, 2013
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