moved by random amounts in a random direction. The animated slider was the amount of deviation from the original points. And yes, I used culled lists.B.t.w. did you find my workaround for your loft? Did your notebook explode? ;)…
tecture. Hochbau | University of Innsbruck . A simple random, but at the same time organised growth routine. 5 iterations for this image.
Link to the course here:
http://www.exparch.at/index.php?option=com_content&task=view&id=1054&Itemid=87
View full size...as per Pieter's suggestion…
nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…
curve B
B1--------------------------B0
You define distances:
|A0 B0|
|A0 B1|
|A1 B0|
|A1 B1|
And find the smallest one. Then, based on the number of the shortest distance:
Flip A, Leave B
Flip A, Flip B
Leave A, Leave B
Leave A, Flip B
A more advanced metric would be to create all 4 blends, then pick the one that is shortest. Maybe that works better for what you want, maybe not.
--
David Rutten
david@mcneel.com…
Added by David Rutten at 8:09am on February 11, 2014