ber of mesh vertices is defined as (precision_+1)^2.So if you would like to have its beam, diffuse and ground-reflected components as well, that means 3 * 8760 values per single point.Example: if you set your precision_ input to 20, the number of values would be a couple of millions:
(20+1)^2 * 8760 * 3 = 11 589 480 hourly values
Check the attached definition below. The outputs that you need are: "Ebeam", "Ediffuse", "Eground".They contain annual hourly values for each tilt and azimuth combination (that's what upper mesh vertices represent) in a data tree.…
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.…
as follows.
We have a grid which consists of a collection of columns, where each column consists of a list of points. You said flattening is out of the question, so we need to cull items from each list individually.
Let's say our culling pattern is KDDDKDD (repeat as needed). K = Keep, D = Ditch. If a column contains 18 points, the pattern needs to be repeated until it is 18 items long. In this case:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
K D D D K D D K D D D K D D K D D D
We can now cull each column, but they will all be culled in the same way. By shifting the pattern one more index for each column, we can cycle the culling.
The fix incidentally is to Shift the pattern PRIOR to repeating it. Then it works as expected:
--
David Rutten
david@mcneel.com
Tirol, Austria…
Added by David Rutten at 2:49pm on October 2, 2013
(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…
into new tree, so that branch {0} has points from branch {0} {1} {2} combined, branch {1} has points from {2} {3} {4}... as it shows in the atached image.
The main problem is that points need to overlap in the new tree.
Any suggestions?…
ated in all editions of Architektura Parametryczna Workshops!Architektura Parametryczna Workshops Optimization Warsaw 2016 FAQWHEN?21-22nd May 2016 (Saturday-Sunday)HOW LONG DO THE WORKHSOPS LAST?The workshops last in total 16 hours.Saturday 10AM -7PM (with lunch break), Sunday 10AM -7PM (with lunch break)WHAT WILL I LEARN?On Saturday the optimization processes with solar, views and structural analysis will be explored. We will be discovering optimal solutions with the help of plug-ins such as Galapagos, Silvereye, Octopus, Karamba and Ladybug. In the Sunday morning we will learn how to present the results of the optimization: creating catalogues of solutions and printing the optimization graphs. In the afternoon participants will have time for the development of the personal project. HOW MUCH DOES IT COST?The workshops cost 600 PLN (or 160€) for Early Bird payments and 700 PLN (or 190€) for the regular payments. The 3-person group - 1500 PLN (or 440€ )EARLY BIRD?For those who are certain that they will attend the workshops, we have a special Early Bird offer till 30th of April 2016.HOW CAN I SIGN UP?Send an email to info@architekturaparametryczna.pl with the title: “OPTI WAW 16”.HOW MANY PLACES ARE AVAILABLE?We have only 11 places!WORKSHOPS: Level: intermediate – advancePerquisites: the basic knowledge of Rhino and Grasshopper3D. Plug-ins: Silvereye, Octopus, Ladybug, Karamba. Weaverbird. Python GHThe main aim of the 16-hour workshops is to give the participants the understanding of how the optimization process can be used in practice and how it can help in solving everyday design problems. The practical exercise will be supported with the short lectures explaining the theoretical background of the optimization algorithms. The general program of the Optimization Warsaw 2016 Workshops*:1. Optimization of the facade geometry with solar analysis.2. Optimization of the roof structures with Karamba.3. Finding the optimal configuration of the space frame structures with Karamba.4. Discovering the best location or/and geometry of the building in accordance to the best views from the plot.5. Presentation of the discovered solutions. *Some of the exercises might be changed.…
ed according to list C.
I tried replace members, but it consists of geometry, so it doesn't worked.
In list C I filtered all the indices that need to be replaced.
All items in {0;0} from C need to be replaced by List B {0;0}
All items in {0;1} from C need to be replaced by List B {0;1}
And so on...
In the end everything needs to be fed into a orient component.
G is the geometry behind list B
A is the new list (but I don't know how to create)
B is the list A of all 60 panels
To wrap up the question:
I need to have entry 1 from list B in a new list on position: 0 1 2 3 5 6 7 10 11 12 15 16 21
I need to have entry 2 from list B in the same new list on position: 4 8 9 13 14 etc. etc. etc.
I wonder how I can do this :) Thanks in advance!
…
}
0,3
{7}
1,2
{8}
1,3
{9}
2,3
{10}
0,1,2
{11}
0,1,3
{12}
0,2,3
{13}
1,2,3
{14}
0,1,2,3
I want it to be parametric so I can have it for any set of indexes
I have tried to solve it with points and then removing duplicate points but it's not helping much
any help is truly appreciated
…
7 -18.2
8 5.02
9 12.4
10 18.1
11 7.01
12 5.11
13 2.35
this data is waveform data.
i want to pick out only climax(for example in upper data, number 1 and 10) from this data.
i have this problem...that is, i do not know to do what.
i think my English is strange...so you are difficult to understanding my question.…
nother nurbs surface that is built from control points extracted from the other two (3 three rows of control points shown in the picture are the ones I would like to use).
When I try to use the "Surface from Points" component, however, I cannot get the surface to generate properly. From my understanding of previous discussions on this forum, the U parameter should be U+1 which in my case would be 11. No parameter from 0-11 is producing the results I'm looking for, however.
My attempted solution is attached. I get the feeling the solution will be quite straightforward...
Thanks,
Austin
…