I extract the first two with a "Redim Preserve t(1)" command.
In the first case, the redim is correct, Line 7 = Line 2 and Line 8 = Line 3. It just kept the first two values like it is supposed to be.
But, for the second curve starting Line 9, some t values are messed up after the Redim. Line 16 = Line 17 despite Line 11 was different from Line 12. That's what is creating a problem later in the Split.
Weird.
…
uts.
If I change the number of polygon sides to 8 the result looks like this:
Note that there are no missing rows with 8 sides. I've tried all the numbers from 3 to 12 and in general an even-number of sides results in no missing rows, but an odd number of sides has a missing row. And for # sides 10 - 12 there are 2 missing rows.
I tried all the options for the Offset object's Corners variable which is use to make the solid outside wall, but this has no effect. I also tried rotating the cutouts a little and a lot, changing their size, height, etc., but this had no effect either. So I'm stuck on how to eliminate the missing row of cutouts.
I realize this is a more or less cosmetic problem (no one will see the bottom of the printed part unless they pick it up), but I'd like to get it fixed before I publish the final design. The attached GH file has all the components used to make these images.
…
Added by Birk Binnard at 11:58am on November 28, 2016
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
g from a list of 12 items I would find all the combinations taking just 4 at time.
I'd use a Stream gate that takes the indexes of the items and pass them to a list item in order to select just the items of the combination. Doing so I can choose a single combination of index at time to pass to the list item.
In this moment all the data come out from the first gate, all the others are empty.
If I pass these index to the list item it gives me an error (probably because of the data structure).
*long version*
I start from a list of 12 segments, all of them with the starting point in common and the ending point distributed regularly in the space. It's a quite simple starting point.
What I'm trying to achieve is to find all the possible spatial configurations made of 2, 3, 4 segments. I started with 2 segments so I've 12^2=144 possible configurations but just 4 different configurations that can intuitivelly be recognized (60°, 90°, 120°, 180°).
Doing the same with 3 segments generates 12^3=1728 configurations and I don't know how many different ones. With 4 segments I've got 12^4=20736 possible configurations.
As you can imagine many configurations are identical but just with a different orientation so at the end I'll have to parse geometrically the output to delete duplicates (I'll address this later on).
Please could you help me to figure out how to mix these segments in different configurations?
Thank you in advance.…
y I have 25 surfaces, and so 25 directions. Everything fine.
But I wanted to have 12 go in one direction and 13 go in the other direction.
What I did was to create both negative and positive directions, having 50 directions for 25 surfaces. So I then proceeded to weave these directions, and split the list in 2.
To the left is what I achieved in grasshopper, to the right is the desired result.
As you can see the first story of prisms is extruded in the wrong direction.
Thanks for any insight.…
bers of point) index
and I called the last point as indexMax
that what I wrote I am sure that I made some mistakes- so if one of you can help me I will be more then glad
If abc(sin(3 * pi() * ptList / ptLast)) < 0.5 Then harmony = 3 = z, 2 = x, 1 = y
A = 0
Else
A = 1
n = 0
For n < ptLast
If A(n) = A(n + 1) Then
Zf(n) = Z(n) + 12 * A(n)
n = n + 1
End If
(n + 4) < ptLast Then
Zf(n) = Z(n) + 12 * A(n)
Zf(n + 4) = Z(n + 4) + 12 * A(n + 4)
Zf(n + 2) = Z(n + 2) + 6
Zf(n + 1) = Z(n + 1) + 6 - 3 * (A(n + 4) - A(n))
Zf(n + 3) = Z(n + 1) + 6 + 3 * (A(n + 4) - A(n))
n = n + 5
End If
Else M = ptLast - n
For n<ptLast
Zf(n) = (ptLast - n) / M * 12 * A(ptLast - M) + Z(n)
n = n + 1
End
Zf(ptLast) = Z(ptLast)
…
m in the first place. What would I use to create these sets in a simple object which I can plug everything into. i.e. a mathematical script which uses one number (the number of items in the column). to join every neighbouring pair together. in this case, 21 rows, in 12 columns. Collecting the sets - 1 to 21 with 22 to 43 then 44 to 65 with 66 to 87 etc etc etc.
The selecting curves for the columns are drawn in Rhino, and are all equal in number (in height) as shown in Top view.
…