掌握编程过程中遇到的思路方面和技术方面的问题. 内容包括以下几个方面:
反向逻辑思维能力的培养;
建立清晰的编程逻辑思维能力;
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…
to give you the data structure you're looking for, simultaneously replicating the sub-path index as the single value per branch, so that you get a data structure like {a;b}(b), in your case {45;10}(10) {45;23}(23) {45;26}(26).
Then, a single line of C# does the rest.
A = D.Branch(R);
The access of R must be set to Item, and the access of D must be set to Tree. This means that D will be loaded into the C# component as one huge array (that's why it takes a little while to load when you open the file). Since R is set to Item, the component will run once for each of the 1150 branches in R. Each time, the branch with the value of R (10, 23, 26) will be populated with the corresponding branch {10}, {23}, {26} of the huge array D.
Hope that helps. When you get back maybe tell me what D and R actually mean?
N…
radius / 3 Then field_value += 1 * (1 - 3 * test_dist ^ 2 / radius ^ 10) ElseIf test_dist >= radius / 3 And test_dist < radius Then field_value += (3 / 2) * (1 - test_dist / radius) ^ 10
Not sure yet how to reduce the new angled beam artifacts.
The question remains whether there is a superior function that avoids bulge completely so I can start rationally designing bulk objects with mere lines.
Actually, if I move a parentheses to make both powers into divisors and tweak the sliders, I get rid of nearly all bulge, while improving the corners:
If test_dist > 0 And test_dist < radius / 3 Then field_value += 1 * (1 - 3 * test_dist ^ 2 / radius ^ 10) ElseIf test_dist >= radius / 3 And test_dist < radius Then field_value += (3 / 2) * (1 - test_dist / radius ^ 10)
That I can work with!
…