掌握编程过程中遇到的思路方面和技术方面的问题. 内容包括以下几个方面:
反向逻辑思维能力的培养;
建立清晰的编程逻辑思维能力;
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…
2. See that? It's a rather simple (kinda) C# that gets the List/Tree of meshes from K1/2, makes automatically suitable layers (user controls names, prefixes, attributes, ... ,cats, dogs etc) and then bakes each item (a Mesh[case: List] or a List of Meshes[case:Tree]) from the mesh List/Tree to the corresponding layer.
3. See that? Well ... it's rather obvious what is is.
Moral: piece of cake (but handling/controlling the C# that does this ... is not, he he).
I'll try to (over) simplify the Dark stuff and I'll post it here.
best, Lord of Darkness
…
image with shows some simple usage of the path mapper.
The points worth noting are the following:
1. The "Source" is comrised of a single line notation which EXACTLY matches the existing path structure. This means that if your parameter viewer shows you a path strcutrure which looks like {0;0;0;1;0} (N=4), your source input should look like {A;B;C;D;E}(i). Here, all the letters A-E and i are placeholders meaning that they can be any letters and are standing by for each digit in your path structure. This also means that they could be any letters: {Q;R;S;T;U}(V) would work as well as {A;X;T;B;S}(J). The important thing is that you are identifying each digit (including the value of 'N', the total items in each path).
2. The "Target" is (obviously) your desired path structure. If you want to simply get rid of the zeros while maintaining essentially the same path structure, it is as simple as dropping out those placeholders while writing the target notation. In the above example, if your source is {Q;R;S;T;U}(V), you can use a targe like {S;T}(V) to return a structure which will be {0;1}(N=4) or {T}(V) for {1}(N=4) and so on.
3. if you want to swap the path structure, i.e. if you have 5 paths with 10 items each and you want 10 paths with 5 items each, you switch the placeholders in the source and target notations. for example, {X;Y}(n) -> {n}(Y)... and so on.
I hope that the above is of some help. Please feel free to keep asking.…
Added by Sameer Kumar at 10:29am on December 7, 2009