element connectivities in text, when matched with the corresponding coordinates of the nodes from dupPt, it makes all the polygons again (Green lines in the picture below), exactly as the original.
So Im thinking its like reconstructing everything again from the original shape with new relation between coordinates and element connectivities.
So in this case, eg: 0 1 2 3 4 5 makes the hexagon, 21 20 0 5 to makes the trapz.
Well here it misses the '0' in the end to close the hexagon here, the same with trapz. However the 'string join' and cset somehow close it to 0 1 2 3 4 5 0 to makes the hexagon, and 21 20 0 5 21 for trapz.
Im very glad now.
…
the one-but-last list [4]. After running out of the n- items avalaible it should continue with the second item of list 0 and so on for all items on all the lists.
Intput, six lists of 30 items each
[0] (n=30)
[1] (n=30)
[2] (n=30)
[3] (n=30)
[4] (n=30)
[5] (n=30)
Output, 18 lists of 10 items each
[0],i=0;[5],i=4; [4],i=7;...
[0],i=1;[5],i=5; [4],i=8;...
...
[5],i=1;[4],i=5; [3],i=0;...
I thought perhaps the weave component or the relative tree item component but didn't manage to figure out how to compose the mask. I couldn't find much on how to use these. I guess it should wrap the lists, but not the items.
Any help would be greatly appreciated.…
Added by Thorsten Lang at 2:27am on January 24, 2011
x and min values for x,y,z and calculate energy for each optionand collect these results in excel sheet ...
option No. x y z Annual coiling demand(by DIva)
1 10 10 10
2 10 15 20
3 11 10 19
4 12 14 17
5 15 16 15
6 16 11 14
7 18 12 12
.
.
etc
Regards ...
hossam
Hossam.wefki@gmail.com…
list with 8 curves into 5 branches, according to their distance to the other curves. So the first branch will have 2 curves, the next one will have 3 and so on...
Thank you!!
…
in the desired order.
0 = 0
1 = 1
2 = 6
3 = 7
4 = 8
5 = 9
6 = 12
7 = 13
8 = 2
9 = 3
10 = 4
11 = 5
12 = 10
13 = 11
Where the first number is the index and the second number is the actual sorting key. Then you sort these keys while sorting your curves in parallel using the A input of the Sort component.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
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.
…
ny iterations at one go as you describe:
http://smartgeometry.org/index.php?option=com_community&view=groups&task=viewdiscussion&topicid=20&groupid=2&Itemid=0
I also posted there an example of linking this to Galapagos - which is something I'd been meaning to explore more for ages. I've not tried it yet with anything more interesting than adjusting the depth of a truss to minimize total displacement, but I think there's a lot more that could be done.…
which will result in creating a check for each branch with one item to be 'matched' (in this case to see if it is included in the domain) with all three domains in the single list. so in the end you get a data tree with 8 branches (derived from the 8 grafted values) with 3 items in each branch, that are the check of each initial value with the 3 items domain list.
thank you for sharing the other option too!.
cheers
alex…