7, 9, 12 and 13 to be able to rotate freely around the y axis at nodes 2, 3, 6, 7, 10 and 11 respectively. The last 2 conditions, for elements 12 and 13, doesn't give any problems, but the first 4 does.
Any help?
…
w list should contain a smallest value of the values with the same index. I should keep order of the indexes.
For example, item [21] of the 1st branch = 1, item [21] of the 2nd branch = 2, so item [21] in the resulting list = 1.
Any advise?…
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
number of divisions on that curve as in the defintion (i.e. by 4). The offset in the def is slightly different and should cull two or three more curves as in the lists that show my aim below.
Basically I want to look into each branch of the groups of points from each closed curve . Marking in a list whether it contains a one or a zero (0= outside 1 = coincidents).
{0;0}0. 21. 22. 23. 2 {0;1} 0. 01. 22. 03. 2 {0;2}0. 01. 02. 03. 0 {0;3}0. 21. 22. 23. 2 {0;4}0. 21. 22. 23. 2 {0;5}0. 21. 22. 23. 2 {0;6}0. 01. 22. 23. 1 {0;7}0. 21. 22. 03. 0 {0;8}0. 21. 22. 23. 2 {0;9}0. 21. 22. 23. 2 {0;10}0. 21. 22. 23. 2 {0;11}0. 21. 22. 23. 2 {0;12}0. 21. 22. 23. 2 {0;13}0. 01. 22. 23. 0 {0;14}0. 21. 22. 23. 2
I want to create a list from these points. That marks each curve that pokes out, in a cull pattern as such:
20022210222202
Using a 1 where there are co-incidents in the curve points and the boundary. A 2 for true (outside points) and a 0 for containment. So I might be able to use the 1 in future developments - however if a true false list is easiest I can live with that.
So could I use F(x) function? - to look for 0 or 1's in each bunch of points and thus list as such for a cull pattern? or will Path mapper help me here? Or can I rely on simply grafting and splitting??
I am usure of the neatest solution and would love to learn. Hope you can direct me.rgrds
J.…
Hello Paul,
There are a number of ways to do this, for example you can use duplicate data; the order toggle will alternate between:
1 2 3 1 2 3 1 2 3 and 1 1 1 2 2 2 3 3 3
Hope this helps
Andrei
- False
{0;2}
0 - False
1 - False
2 - True
3 - False
{0;3}
0 - False
1 - False
2 - False
3 - False
Is there anyway I can get a GATE OR result from this list, where the GATE OR is applied between all the corresponding list items. So the end result will be;
{0;0;0} ??
0 - True
1 - True
2 - True
3 - False…
Added by Andrew Butler at 11:26am on November 6, 2010
English.
Hi all!
I created .ghx for Parametric Design of Bottle. I defined profile curves giving control points with slider, definition of hight, shifting, and offset based on referenced…
ok, very similar to what i am looking for, but the thing is i have a list not just like (0,n), its like (0;0)...(0;3),(1;0)...(1;3), (2;0)...(2;3), etc