9 8 7 6
5 4 3 2 1 0
I am triangulating this surface. I want to select just the red vertices. As you can note, I just need the inner vertices of this surface. I could do it mannually, but if I want to change the mesh density later, I will have to pick all of them manually again later.
Can someone help me?
Tks
…
この前のOpen fab nightで扱ったKangarooの日本語の解説が乗っているサイトがあります。興味ある方は参考にどうぞ
http://www.grasshopper3d.com/profiles/blogs/2985220:BlogPost:1222944?xg_source=activity
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
)
3. KeyError(1417,)
4. KeyError(1417,)
5. KeyError(1417,)
6. KeyError(1417,)
7. KeyError(1417,)
8. KeyError(1417,)
9. KeyError(1417,)
10. KeyError(1417,)
11.......
i tried different weather file but also same result. it seems i have same problem. the file am working on is the radiation file i took from the examples . whats seems to be the problem?
thank you for your time…
ee 3)
{5}
0 15
{6}
0 16
And I want to place points at every possible combination of these coordinates, treating Tree 1 as X coordinates, Tree 2 as Y coordinates, and Tree 3 as Z coordinates. Also, I would like the list of points to be a tree with paths corresponding to the coordinates. Wouldn't it be nice if I could plug these trees into a Point XYZ, with a new "branch cross reference" method, and get the following result?
{0:3:5}
0 {10.0, 13.0, 15.0}
{0:3:6}
0 {10.0, 13.0, 16.0}
{0:4:5}
0 {10.0, 14.0, 15.0}
{0:4:6}
0 {10.0, 14.0, 16.0}
{1:3:5}
0 {11.0, 13.0, 15.0}
{1:3:6}
0 {11.0, 13.0, 16.0}
{1:4:5}
0 {11.0, 14.0, 15.0}
{1:4:6}
0 {11.0, 14.0, 16.0}
{2:3:5}
0 {12.0, 13.0, 15.0}
{2:3:6}
0 {12.0, 13.0, 16.0}
{2:4:5}
0 {12.0, 14.0, 15.0}
{2:4:6}
0 {12.0, 14.0, 16.0}
In this form of cross referencing, every combination of individual branches from the different lists is used as separate input, and the output for each combination is put onto a branch in the result whose path is the concatenation of the input branch paths used.…
Added by Andy Edwards at 7:03pm on November 3, 2009
pen Brep"; I didn't know it worked on flat surfaces. And I think it's only fair to include in your benchmark the considerable time 'SUnion' takes in this example: 21.9 seconds for 121 rings and likely much more with 400 or 1,000+ rings.
Then I noticed the pattern doesn't match. Checked the circles and they are the same. The distance between them, however, is different: 7 instead of 6. When I change that value to 6, the Python fails badly. All the holes and gaps are gone, which destroys the pattern:
I can't do the "two phase" approach on an 11 X 11 grid, but I can do 6 X 6 and 2 X 2 to get a 12 X 12 grid (40 'SUnion' operations) in 28 seconds total. That beats your benchmark of ~37 seconds for an 11 X 11 grid, if you include the 'SUnion' in your code.
…
etting when I merge the three trees, but what I would like to get is:
essentially a tree with 27 branches, each with a single list of either 11 or 21 points.
{0} (N=11)
{1} (N=11)
...
{10} (N=21)
{11} (N=21)
...
{17} (N=11)
{18) (N=11)
{27} (N=11)
Any help would be greatly appreciated.
All the best,
Matt
…
Added by Matt Schmid at 3:06pm on December 4, 2010