s happening with other components as well (flatten is checked off!)
so : ... 3 lists of 8 points , instead of getting {0} (0,1,2,3,4,5,6)
{1} (0,1,2,3,4,5,6,7) {2} (0,1,2,3,4,5,6,7)
I just get a list of 24 points?
can someone explain why, and how i create 3 seperate lists from this?
thank you.…
s suivantes
{0;0} {0;0}
0=longueur (300) 0=longueur (400)
1=largeur (8) 1=largeur (6)
2=hauteur (20) 2=hauteur (8)
{0;1} {0;1}
0=longueur (250) 0=longueur (250)
1=largeur (8) 1=largeur (8)
2=hauteur (12) 2=hauteur (12)
{0;2} {0;2}
0=longueur (400) 0=longueur (300)
1=largeur (6) 1=largeur (8)
2=hauteur (8) 2=hauteur (20)
je souhaite réorganiser mes listes en fonction de la croissance de l'item 1 (soit la largeur) puis en fonction de l'item 2 (la hauteur) néanmoins pour chacune de ces listes les items sont indissociables .
dans l'exemple de gauche la liste de rhino et dans l'exemple de droite la liste que je souhaite obtenir c'est d'abord la largeur qui va croissante puis ,lorsque les largeurs sont identiques ce sont les hauteurs qui vont dans l'ordre croissant .Les longueurs restent assignées à la liste.…
se the cull pattern, so I wanted to make the pattern using a function component. x=y. x= the original list and y= the interval i wanted to remove. So the pattern should be:
0: false
1:false
2:false
3:false
4:true
5:true
6:true
7:true
8:false
9:false
10:false
etc...…
Added by Rasmus Holst at 3:32am on November 17, 2009
fset the original curve in Z axis.
4) Offset my 3rd curve in the Y axis.
5) Divide al the curves into equal segments.
6) Use a cull pattern with "Tue False-False True" Booleans.
7) Connect the culled points.
8) Pipe around the curves.
I dont´s know why my conections go from point 1 to point 2, and instead of keep going from point 2 to point 3, it starts back on point 3 to point 4.
I´m sending the image of what I´m getting, the image of what I want to get, and the definition in case anyone can help me modifying some parameters or components. Thanks!…
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.…
ems in the same way. Lofting was particularly difficult, you had to have a separate loft component for every lofted surface that you wanted to generate because the component would/could only see one large list of inputs. Then came along the data structures in GH v0.6 which allowed for the segregation of multiple input sets.
If you go to Section 8: The Garden of Forking Paths of the Grasshopper Primer 2nd Edition you will find the image above describing the storing of data.
Here you will notice a similarity between the path {0;0;0;0}(N=6) and the pathmapper Mask {A;B;C;D}(i). A is a placeholder for all of the first Branch structures (in this case just 0). B is a place holder for all the second branch structures possibly either 0, 1 or 2 in this case. And so forth.
(i) is a place holder for the index of N. If you think of it like a for loop the i plays the same role. For the example {A;B;C;D}(i) --> {i\3}
{0;0;0;0}(0) --> {0\3} = {0}
{0;0;0;0}(1) --> {1\3} = {0}
{0;0;0;0}(2) --> {2\3} = {0}
{0;0;0;0}(3) --> {3\3} = {1}
{0;0;0;0}(4) --> {4\3} = {1}
{0;0;0;0}(5) --> {5\3} = {1}
{0;0;0;1}(0) --> {0\3} = {0}
{0;0;0;1}(1) --> {1\3} = {0}
{0;0;0;1}(2) --> {2\3} = {0}
{0;0;0;1}(3) --> {3\3} = {1}
{0;0;0;1}(4) --> {4\3} = {1}
{0;0;0;1}(5) --> {5\3} = {1}
{0;0;0;1}(6) --> {6\3} = {2}
{0;0;0;1}(7) --> {7\3} = {2}
{0;0;0;1}(8) --> {8\3} = {2}
...
{0;2;1;1}(8) --> {8\3} = {2}
I'm not entirely sure why you want to do this particular exercise but it goes some way towards describing the process.
The reason for the tidy up: every time the data stream passes through a component that influences the path structure it adds a branch. This can get very unwieldy if you let it go to far. some times I've ended up with structures like {0;0;1;0;0;0;3;0;0;0;14}(N=1) and by remapping the structure to {A;B;C} you get {0;0;1}(N=15) and is much neater to deal with.
If you ever need to see what the structure is there is a component called Param Viewer on the first Tab Param>Special Icon is a tree. It has two modes text and visual double click to switch between the two.
Have a look at this example of three scenarios in three situations to see how the data structure changes depending on what components are doing.
…
he same order of the list. for example i have a list with 4 different lenght of curve like this:
0= 10
1= 12
2= 8 (minimum)
3= 17 (maximum)
and wont to make a ranking that the longest curve gets the value 4 and the smallest the value 1, like this
0= 2
1= 3
2= 1
3= 4
i tried the sort list function, but it dosn`t work
can anybody help me!
thx a lot…