here are 11 numbers (0 to 10), and a 'step' of 42 (0 to 42 to 84), and I need to be able to 'cap' the number of times the 11 numbers are added, for example 3 for the list above.
I'm sure this is simple, and I'm kicking myself that I can't figure it out for myself, so any help would be greatly appreciated!…
this, you'll have no horizontal force at the roller, but you will have it at the pinned support. If you wouldn't, then the structure will be displaced.
Usually, in 2 dimensional structures, if you want to know if an articulated structure is isostatic (as opposed to hyperstatic, which is what you have right now) is to use the following formula:
b+c-2·n=0;
b being the number of bars, c the number of constraints you have and n the number of nodes. In your case: b=19, c=3 (displacements constrained in X, Z at your pinned support and only constrained in Z at your roller support) and n=11, so: 19+3-2·11=0.
I recommend you to download the app SW Truss, as it's very useful to check your results instantly.…
rve
10 curve
11 curve
12 curve
13 curve
...and I'd like to rearrange the order in which the curve are listed, to something like this:
{0,0,0}
0 curve
1 curve
8 curve
9 curve
10 curve
11 curve
2 curve
3 curve
4 curve
5 curve
12 curve
13 curve
6 curve
7 curve
I hope this makes sense.
Thank in advance for any advice,
John…
erations, is not it?
This is what I finally want and how I plan to do it:
In the starting tree, points are listed accordingly to the (11) 4-side-panels they belong to. I need to do a tree where each of the 11 lists contains not the points composing the panels but the points code of the points composing the panels. the point code is the number in the flattened list that refers to the points (like, panel 1 is made of points n 0,1,4,18, and so on). To do this, I suppose that I will use my tree of 11 lists of 33 true-false values, and apply it to cull 11 times a series of numbers from 0 to 32. I ll post it if it works!…
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?…
nput parameter and then set the named values on the second?
protected override void BeforeSolveInstance() { Param_Integer param0 = Params.Input[0] as Param_Integer; Param_Integer param1 = Params.Input[1] as Param_Integer; param1.ClearNamedValues();
GH_Structure<GH_Integer> data = param0.VolatileData as GH_Structure<GH_Integer>; if (data.IsEmpty) return; foreach (GH_Integer value in data.AllData(true)) { switch (value.Value) { case 1: param1.AddNamedValue("First option for 1", 11); param1.AddNamedValue("Second option for 1", 12); param1.AddNamedValue("Third option for 1", 13); break;
case 2: param1.AddNamedValue("First option for 2", 21); param1.AddNamedValue("Second option for 2", 22); param1.AddNamedValue("Third option for 2", 23); break;
case 3: param1.AddNamedValue("First option for 3", 31); param1.AddNamedValue("Second option for 3", 32); param1.AddNamedValue("Third option for 3", 33); break; } return; } }
--
David Rutten
david@mcneel.com…
Added by David Rutten at 1:56am on December 18, 2013
ult, my 3dm is very large.
Another problem, when the fonction is ok, the draw in grasshopper is ok, when i bake i have only a litte part of the opération.....
If you could help me, thank you
[Edit] Here the description in the null item :
{0;0}0. Brep: brep.m_T[43047] trim is not valid. trim.m_type = seam, the edge is manifold, but brep.m_L[trim.m_li=1114].m_type is not outer.brep.m_L[1114] loop is not valid. brep.m_T[loop.m_ti[21]=43047] is not valid.brep.m_F[0] face is not valid. brep.m_L[face.m_li[1114]=1114] is not valid.ON_Brep.m_F[0] is invalid.1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. …