I have a tree that has 25 branches and each branch has 4 values
{0;0;0} (N=4) ....{0;0;24}(N=4)
is there a way to compile a list of the min value of each branch? ie the list should contain 25 numbers.
Added by jon kontuly at 3:51pm on January 24, 2010
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
ents will do or which components will be available.
My problem arises because I want to obtain a list such as the following:
{{6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6}, {5, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5}, {4, 5, 6, 5, 4, 3, 2, 1, 2, 3, 4}, {3, 4, 5, 6, 5, 4, 3, 2, 1, 2, 3}, {2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 2}, {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1}}
Which displayed as a matrix is:
If it were possible to combine GH operations (series, shift list, replace string...) with matrices I think it would be quite powerful. A matrix to list component like those available on scientific calculators, would then translate the matrix to list.
For me, matrices come in handy when dealing with surface patterns.
…
Added by Jesus Galvez at 6:46am on November 26, 2012
be used for list components like reverse, list item, cull, shift, list length, split... so that they can operate on items or on branches at any level.
for instance, base on the original list:
List Lenght with level 0 (default) would be
{0;0;0}(4)
{0;0;1}(4)
{0;0;2}(4)
{0;1;0}(4)
{0;1;1}(4)
{0;1;2}(4)
With level 1 it would be
{0;0}(3)
{0;1}(3)
With level set to 2 it would be
{0}(2)
Does it make sense? Or maybe this functionality is again hiding from me in plain sight :)
…
Added by Frane Zilic at 11:39pm on August 14, 2012
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?
I want to create polyline from the points seen in the list. point sequence must be
(0:0:0) point0;(0:0:1)point1;(0:0:2)point2;(0:0:3)point3;(0:0:4)point4...
How can I solve this problem?
Emre
53 → 53 → 63 → 74 → 74 → 84 → 9
As you can see from the above list the connection sequence comes in waves of three, where each group of similar indices on the left is associated with a group of three incrementing indices on the right.
Some combination of Series components will probably generate this list, but it'll only work for the first ring, the second one will need a different connection pattern. It is perhaps better to just encode the integer pairs by hand. But then you cannot change your mind about the number of sides later.…
Added by David Rutten at 10:39am on October 21, 2015