ersect (2, 3, 4, 5, 6) with the line and the ones which do not intersect (0, 1, 7). Intersect is done! But how to get the non intersecting vectors (0, 1, 7)?
So I e. g. could deselect vectors 2, 3, 4, 5, 6 so I would display/use only vectors 0, 1, 7 and the bounced ones.
Appreciate your help!
Rudi…
e possible to change the component definition making possible to customize the number of outputs.Now Dispatch moves "true" values to A and "False" values to B
INPUT:
L (List to work on) -> 1, 2, 3, 4, 5, 6, 7, 8
D (Dispatch Pattern) -> True, False
OUTPUT:
A (List) -> 1, 3, 5, 7
B (List) -> 2, 4, 6, 8
Could it be possible/useful to modify it so it could dispatch items to several outputs, like:
INPUT:
L (List to work on) -> 1, 2, 3, 4, 5, 6, 7, 8, 9, 0
D (Dispatch Pattern) -> A, B, C
OUTPUT:
A (List) -> 1, 4, 7, 0
B (List) -> 2, 5, 8
C (List) -> 3, 6, 9
maybe I'm missing something and there's already a component with this function... I have been searching on the forum for half afternoon, but can't find anything about it!
Thank you!…
Maybe with numbers it would be easier to understand.
If there is 1 insert to the list 5
If there is a 5 insert to the list 6 or 4
So if i start from 1 one possible list would be: {1, 5, 6}
bers of point) index
and I called the last point as indexMax
that what I wrote I am sure that I made some mistakes- so if one of you can help me I will be more then glad
If abc(sin(3 * pi() * ptList / ptLast)) < 0.5 Then harmony = 3 = z, 2 = x, 1 = y
A = 0
Else
A = 1
n = 0
For n < ptLast
If A(n) = A(n + 1) Then
Zf(n) = Z(n) + 12 * A(n)
n = n + 1
End If
(n + 4) < ptLast Then
Zf(n) = Z(n) + 12 * A(n)
Zf(n + 4) = Z(n + 4) + 12 * A(n + 4)
Zf(n + 2) = Z(n + 2) + 6
Zf(n + 1) = Z(n + 1) + 6 - 3 * (A(n + 4) - A(n))
Zf(n + 3) = Z(n + 1) + 6 + 3 * (A(n + 4) - A(n))
n = n + 5
End If
Else M = ptLast - n
For n<ptLast
Zf(n) = (ptLast - n) / M * 12 * A(ptLast - M) + Z(n)
n = n + 1
End
Zf(ptLast) = Z(ptLast)
…
l at each point intersection, less 14. align holes to common angle between each 2 points of intersection (so ovals align with curve)5. copy 4. 360/60 about center circle (creates 6 curves rotated thru 360)6. it appears there a 3 more sets of curves that need to be taken care in the same way as 1 thru 4 (see colander pic)6. project the oval patterns onto, 1/2 a sphere somewhat larger that the surface circle, to avoid extreme oval distortion.7. needs some Boolean subtraction of holes from sphere surface
Does this simple road map have some merit?
…
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
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