7, 9, 12 and 13 to be able to rotate freely around the y axis at nodes 2, 3, 6, 7, 10 and 11 respectively. The last 2 conditions, for elements 12 and 13, doesn't give any problems, but the first 4 does.
Any help?
…
the curves on surface issue it's solved seting flatten to the surface control point output. Still didnt know how to group points like:
1;1, 2;2, 3;3.....
1;2, 2;3, 3;4....
1;3, 2;4, 3;5...
....
am however having a problem with something simple - limiting a set of values between a fixed set that I need help with please?
For example, I'd like to transform this list . . .
(2, 16, 4, 65, 12, 41, 7, 1, 22)
into this one . . .
(5, 16, 5, 25, 12, 25, 7, 5, 22)
i.e. selecting all numbers below 5 and changing them to 5 and selecting all numbers above 25 and changing them to 25.
I know it's possible with a simple If, Not, Then series but I'm rubbish at code!
Also, is there a simple way to apply dimensions to rhino objects from within GH?
Thanks for your help!
Cheers
James…
each circle's border, let us say 1.0
3) So, the curve will end up with 5 points, in each point will have a circle, each circle will have a different Radius, but the distance in between the borders of each circle is always the same = 1.0 in this case.
4) The end result list here would be like this to evaluate a curve with these values and find the points on the curve:
List = 1, 5, 11, 19 etc If I use these values to eval a line, I will get the perfect points where I can draw the circles.
…
, branches, and trees.
This is currently how I think of it:
A 'point' component with 5 points will generally be compared to a 1-dimensional array with 5 indices.
If we flip this "path" then it becomes a 2-dimensional array looking like this [5][1].
Although it seems like Grasshopper does not iterate through these 'arrays' as one would assume.
Also, the question arises when we have a "tree" whose "paths" looks like:
{0;0;0} (5)
{0;0;1} (5)
{0;1;0} (5)
{0;1;1} (5)
{1;0;0} (5)
{1;0;1} (5)
{1;1;0} (5)
{1;1;1} (5)
For example.
Anyone have any insight here? Or where insight may be found.
Thanks!…