Establish that it is being taught at schools: USC, Cornell, Columbia etc...
http://woojsung.com/2009/09/09/grasshopper-workshop-at-cornell-architecture/
Can anyone add to the list of schools that are teaching it?
And talk about notable projects it has been used on, that should be enough to keep the article from being deleted.…
number of divisions on that curve as in the defintion (i.e. by 4). The offset in the def is slightly different and should cull two or three more curves as in the lists that show my aim below.
Basically I want to look into each branch of the groups of points from each closed curve . Marking in a list whether it contains a one or a zero (0= outside 1 = coincidents).
{0;0}0. 21. 22. 23. 2 {0;1} 0. 01. 22. 03. 2 {0;2}0. 01. 02. 03. 0 {0;3}0. 21. 22. 23. 2 {0;4}0. 21. 22. 23. 2 {0;5}0. 21. 22. 23. 2 {0;6}0. 01. 22. 23. 1 {0;7}0. 21. 22. 03. 0 {0;8}0. 21. 22. 23. 2 {0;9}0. 21. 22. 23. 2 {0;10}0. 21. 22. 23. 2 {0;11}0. 21. 22. 23. 2 {0;12}0. 21. 22. 23. 2 {0;13}0. 01. 22. 23. 0 {0;14}0. 21. 22. 23. 2
I want to create a list from these points. That marks each curve that pokes out, in a cull pattern as such:
20022210222202
Using a 1 where there are co-incidents in the curve points and the boundary. A 2 for true (outside points) and a 0 for containment. So I might be able to use the 1 in future developments - however if a true false list is easiest I can live with that.
So could I use F(x) function? - to look for 0 or 1's in each bunch of points and thus list as such for a cull pattern? or will Path mapper help me here? Or can I rely on simply grafting and splitting??
I am usure of the neatest solution and would love to learn. Hope you can direct me.rgrds
J.…
tA = {A, B, C}
SetB = {U, V, W, X, Y, Z}
Imap = {0, 0, 2, 2, 3, 4}
If I use your proposed method, then the result would be (displayed for each insertion):
{U, A, B, C} 'insert U at index 0
{V, U, A, B, C} 'insert V at index 0
{V, U, W, A, B, C} 'insert W at index 2
{V, U, X, W, A, B, C} 'insert X at index 2
{V, U, X, Y, W, A, B, C} 'insert Y at index 3
{V, U, X, Y, Z, W, A, B, C} 'insert Z at index 4
Whenever I insert an item into the list, it bumps all subsequent items up by one. This means that the *order* in which SetB and Imap are supplied greatly affects the result.
In the current scheme, the order is irrelevant, except for when you have identical index values, then the order should remain intact.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 6:29am on September 10, 2010
Are examples of power functions with x in the base, whereas:
2x
3x
0.5x
Are examples of exponential growth where x is in the exponent.
I can't repeat your problem though, the distances are all different in my file:
--
David Rutten
david@mcneel.com
Tirol, Austria…
Added by David Rutten at 8:47am on September 20, 2013
0;4}
{1;0;0} {1;0;1} {1;0;2} {1;0;3}
{2;0;0} {2;0;1} {2;0;2} {2;0;3}
now i want to extract all the datas in the {0;x;x} format out and put into one separate array
and do the same thing to {1;x;x} and {2;x;x}
and what if I have more branchs than 3?
Is there a way that can automatically sort the list through and extract all datas of one branch
anyone can help?
thanks a lot
…
os(3*v)
y = u^2*cos(2*v)
z = -u*sin(v)-u^(3)/3*sin(3*v)
and the domain i want to display is:
u: 0 to 1
v: -PI to PI
One way of creating this surface would be like this:
The expression component must be set to "cross-reference".
Although it doesn't look pretty, to simplify the definition i concatenated the 3 equations using the syntax to create directly a point from an expression component, this is "{x,y,z}".…
Added by Vicente Soler at 4:37pm on November 29, 2009