ace discrete from one another. However, even though you have selected the point furthest from your base surface, that list of distances retains the data structure of being 11 discrete lists. Meanwhile, your original surface list doesn't have any data structure. You can read this in the wires: the flat surface list is a double-lined wire, and your structured distance data is a double dotted-lined wire. You also can see it in how the distances are represented in your panel, with each one separate from the rest and assigned a data path address ({0;0}, {0;1}, etc.). Right now, grasshopper is reading your inputs like 11 distinct operations of a single distance against 11 surfaces.
You can either "flatten" your data tree of distances to have it match your list of surfaces - if you right click on the T input on your move function, you can select it there - or you can "graft" your list of surfaces into 11 discrete data paths in similar fashion.…
know how to solve.
It appears in
11 - Honeybee Energy Modeling - The Laws of Geometry in E+ Part 3: Curved Geometry
where I need to retrieve .idf file,
and shows this message:
1. Solution exception:'hb_EPZoneSurface' object has no attribute 'punchedGeometry'
I've added .gh file at a state where I meet the problem.
Also, I've looked around the forum and found some mention OpeanStudio related problems, mainly one's lack of it. Could it be the source of the problem, because I only followed Installation Instructions and haven't installed OpenStudio.
…
rcle A 0---1---2Circle B 0---1---2---3---4---5---6---7---8---9---10---11I was actually trying to connect through separated lines, point (A,0) to (B,11) and (B,1),point (A,1) to point (B,3) and (B,5), and (A,2) to (B,7) and (B,9).I was able to do it using a list item selecting the points and creating a line between them, but i would be to long to do it if i would like to divide in many more points, and try to connect them using list item... i went looking around for a bit, i think its possible to do it with a path mapper or a flip matrix, althought i have no clue how to make it.
You will find enclosed, some screenshots...If anyone could give me any tip, i thank you all in advance.Have a nice day.+Joan…
Added by Joan tarragon at 7:38am on December 5, 2011
ler way.
There are 11 lists but the data inside a list could be as high at 10,000 how can I ad all the 0's 1's 2's etc together to get the sum total of all the lists.
Hope this makes sense.
…
onsecutive points at the same height then your 'Break at discontinuities' component eliminates the middle point completely and then the 'Interpolate Curve' component gives a much bigger bump in the wrong direction. This was enough to get curves to meet from opposite sides.
I fixed this by changing the heights to 1.1 or 2.9, rather than 1.0 and 3.0, but it took a little while to work it out! Sigh.
I attach a new version. But I actually preferred it as it was before. See what you think!
Bob
p.s. in the first list, elements 11, 12, 23 and 24 go from 1 to 3; elements 17 and 18 go from 3 to 1. In the second list, elements 6, 17, 18 and 29 go from 1 to 3; elements 12 and 23 go from 3 to 1. Given the above fix, these can be easily seen.…
Added by Bob Mackay at 10:40pm on November 24, 2015
(18, 11, 0, 17), also put in the assembly component.
How can I know which value of the reaction forces correspond to which support?
In the manual is stated that when the reaction force component is used, than the values are displayed in ascending sequence of the corresponding nodes.So if I input the support nodes like thispoint with index 18point with index 11point with index 0point with index 17are the reaction forces displayed like this (per loadcase)?0 - reaction forces in point with index 01 - reaction forces in point with index 112 - reaction forces in point with index 183 - reaction forces in point with index 17
Thanks!
BestLara…
r like in Excel columns) - it includes some ridiculous error checking with Gh testing + stream filters which I'll likely replace with more efficient Python when I revisit. Let me know your thoughts.
Best,
Brian…
Added by Brian Ringley at 2:59pm on September 16, 2015