掌握编程过程中遇到的思路方面和技术方面的问题. 内容包括以下几个方面:
反向逻辑思维能力的培养;
建立清晰的编程逻辑思维能力;
GH 的程序设计理念;
并行数据结构深入理解和控制.
Grasshopper course of McNeel Asia focus on the cultivation of students flexible use of programming techniques, the ability to solve practical problems. Our course deep into the whole process of programming, from programming thinking model, the components principle to usage details do detailed explanation, help students complete mastery programming encountered in the process of thinking and technical aspects, include the following content:
Ability of reverse logical thinking;
Establishment of clear programming logical thinking ability;
The program design concept of Grasshopper;
Understanding parallel data tree structure and how to control it.
更多详细内容... More details…
授课讲师 Instructor 课程由Grasshopper原厂McNeel公司在中国地区的两位 Rhino 原厂技术推广工程师 – Dixon、Jessesn联合授课。课程结束后对达到授课预定目标的学员颁发唯一由Grasshopper原厂认证的结业证书.
Dixon & Jessesn, McNeel Asia Support engineer, by the end of course student who achieve the intended target will get the authentication certificate from McNeel Asia.
课程报名 Register this course 课程即日开始报名, 开课一周前停止报名, 名额满提前报名结束. This course begin to sign up, stop sign up a week ago, with the quota ahead over.
在线报名参加课程...
Sign up to this course…
课程日期 Schedule 7/15-7/20 Beijing 北京 7/26-7/31 Shanghai 上海 7/07-7/12 Shenzhen 深圳
课程范例演示 Samples of Grasshopper course demo
Note: pls follow below comments by Jessesn to see the samples…
finition and see.
There are two sets of points, what I want to do is simply to delete/subsract the points from set 1 (121 points) which are the same as set 2 (9 points). After that, I want to retrieve the remaining points of set 1.
Is there a way to delete one set of numbers/geometries from another set if they are the same?
Many Thanks,
M
Is there a way to do that?…
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.
…
never I plug it into any other component (addition for example), the tree restructures itself as: (121 branches)
{0,0}
{0,1}
{0,2}
...
{0,120}
This is not a problem if I want to do any computation on the whole data. However, to retrieve a specific branch parametrically (based on its {a,b} position in the tree), my definition does not work because of the self-assigned structure. I'd like to be able to sort this using the Path Mapper but I can't work out the logic to do it or is there a simpler way?
I attached part of my definition with Param Viewer for the relevant part as well as the whole WIP GH definition.
Note: The definition uses Geco and Mesh Explode (2 different plugins) using GH 0.9.0014
Thanks to anyone in advance for any help.
Cheers.…
what does u, v and a mean but there was little explanation. I would appreciate it if you guys can point me to where I can learn more about these 2 equations and their parameters. Thanks!…
Added by Hien Nguyen at 6:14pm on January 26, 2017
is:
List<int[]> mapping = new List<int[]>{ new int[2]{0,0},new int[2]{0,1} ... new int[2]{n,n} };
When first integer is index of list index, and second integer is index of element inside list.
When I want to select 5th element from nested list it looks like this:
Object NthElement = NestedList[ mapping[5][0] ] mapping[5][1];
Any suggestions for selecting nth element from nested list without introducing this mapping thing would be very helpful.
Thank you.…