CA, DA, DC)Two of those diagonal lengths are obviously redundant but they allow you to simply shift the array to get at different rotational permutations. This makes the search for the nearest mean a bit more straightforward since, in the context of panel clustering, you'd need to consider all rotational permutations of each one.…
Added by David Reeves at 5:26am on November 9, 2014
Studio serves as a firm-wide resource to LMN, our collaborators, business partners, and clients we will also be sharing with the design community our successes, research, and hopefully not too often, our failures.
Our blog at lmnts.lmnarchitects.com is just beginning but stop by to see what we're working on in Grasshopper, download definitions, and check out our latest endeavors.
…
It should work as you suspected. You may be getting 81 lines instead of 9 either because you've set the component as "cross-reference" or you've got one of the lists divided into different paths.
Added by Vicente Soler at 7:31pm on October 25, 2009
closest point to the very first would be removed from the list, so the initial list reduces from 100 to 98. From the 98 i pick one and search the remaining 97 for the closest. From the remaining 96 i pick again one and search in the 95,...
(The product I want to result is:
having a number of random lines in 3D space, produced by an even number of points as discribed, this shall be the initial springs for a ("selfadjusting") tensegrity. Each one of these lines (later springs in kangaroo) get divided in three areas - that means four points. These four points again are the "attractor points" of neighbor springs, so the strut "knows" where to set the next elastic connection,...the rest I´ll have to figure out)
angelos…