ll these 12500 points.
Group 1 would represent the point located at 0, 5, 10, 15, 20 etc.
Group 2 - 1, 6, 11, 16, 21 etc.
Group 3 - 2, 7, 12, 17, 22 etc.
Group 4 - 3, 8, 13, 18, 23 etc.
Group 5 - 4, 9, 14, 19, 24 etc.
I can create the pattern but the selection of points are all the points in row 0 and then all the points in row 5 and so on.
I would like the selection of points to start at the bottom left, and sequentially continue to the right and then continue on the 2nd row (left to right & bottom to top). i am hoping the pattern i am trying to achieve is more understood with the quick screen capture I uploaded.
the end goal is to be able to select all the points in the grid that are in each pattern.
Thanks in advance for any guidance with this. …
Added by Alyne Rankin at 6:53am on October 11, 2017
t / int, or \ in Vb.Net).
- there's no need to graft or do anything with trees in the script above: it already handles all the shift logic internally. The letters give you a hint as to which part you are getting: E (even cells), O (odd cells), T (top triangles), etc. Try to draw the diagonals on paper to see which ones share a similarity, that's also what I did to write the script. It is rather repetitive and would need some pages to explain line by line.
Finally, I'm attaching a full and simple example showing how to use the script with normals. Please post your definition if you are encountering any other problem. The normals are all on the right side I hope (see pic).
Hope this helps,
Giulio…
English.
Hi all!
I created .ghx for Parametric Design of Bottle. I defined profile curves giving control points with slider, definition of hight, shifting, and offset based on referenced…
g to keep the {15} {16} branch structure because its keeping the organization by floor level.
Any insight into how the Curve Plane Intersection is matching the branches for operation would be helpful as well.
Thanks!
…
vas
Closing and creating a new file (memory resets when this is done) @4:00, 5:57, 6:53
System slow down and crashes @ 8:16 (takes 5 minutes to end the process - perhaps not the most entertaining movie to watch until the end - a good point to turn the kettle on)…
Integer = 0 To 9
val *= 2
lst.Add(val)
Next
Since val is a ValueType, when we assign it to the list we actually put a copy of val into the list. Thus, the list contains the following memory layout:
[0] = 2
[1] = 4
[2] = 8
[3] = 16
[4] = 32
[5] = 64
[6] = 128
[7] = 256
[8] = 512
[9] = 1024
Now let's assume we do the same, but with OnLines:
Dim ln As New OnLine(A, B)
Dim lst As New List(Of OnLine)
For i As Integer = 0 To 9
ln.Transform(xform)
lst.Add(ln)
Next
When we declare ln on line 1, it is assigned an address in memory, say "24 Bell Ave." Then we modify that one line over and over, and keep on adding the same address to lst. Thus, the memory layout of lst is now:
[0] = "24 Bell Ave."
[1] = "24 Bell Ave."
[2] = "24 Bell Ave."
[3] = "24 Bell Ave."
[4] = "24 Bell Ave."
[5] = "24 Bell Ave."
[6] = "24 Bell Ave."
[7] = "24 Bell Ave."
[8] = "24 Bell Ave."
[9] = "24 Bell Ave."
To do this properly, we need to create a unique line for every element in lst:
Dim lst As New List(Of OnLine)
For i As Integer = 0 To 9
Dim ln As New OnLine(A, B)
ln.Transform(xform)
lst.Add(ln)
Next
Now, ln is constructed not just once, but whenever the loop runs. And every time it is constructed, a new piece of memory is reserved for it and a new address is created. So now the list memory layout is:
[0] = "24 Bell Ave."
[1] = "12 Pike St."
[2] = "377 The Pines"
[3] = "3670 Woodland Park Ave."
[4] = "99 Zoo Ln."
[5] = "13a District Rd."
[6] = "2 Penny Lane"
[7] = "10 Broadway"
[8] = "225 Franklin Ave."
[9] = "420 Paper St."
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 6:26am on September 9, 2010
t stuff because i cant get around in setting up the datastructure for following.(my second posted def is somehow a start)
i have a srf - > with eg 3/3 uv segments which gives 16 points.
so now im trying to get for everypoint, its direct neighbors, which constructs lines.
i would then get , as in example described, 16 branches with associated points in it.
tricky thing is that
at the corners there are only 3 pts in one branch.
on the edges there are only 4 pts in one branch.
inside there are 5 pts in one branch.
somehow it seems so easy to bring up the logics but then if i try in gh i fail :-)
any thoughts ?
…