Exploration of Theme

Tutorial discussing the lists:

http://designreform.net/2009/04/rhino-grasshopper-list-management/

Explanation of Spider Web Algorithm

"6.1.1 The SpiderWeb algorithm.

For each maximally connected set of hits within and with respect to a given 3-dimensional cube, we interpolate an interior articulation point AP (center of mass of all the hits in the set) and for each pair of adjacent hits in the set, we form a triangle consisting of AP and the two adjacent hits. We repeat this action for all cubes with hits.

Note that in 2 dimensions the triangle degenerates to a segment connecting the 2 hits and the algorithm produces a set of contours satisfying the axioms.

In 3 dimensions this produces a collection of oriented 2-manifolds satisfying the axioms, consisting of triangles. In higher dimensions it can also be used to produce the correct manifolds. For example, in 4 dimensions it produces, within each hypercube, the two-dimensional boundary of each 3-dimensional surface patch of the manifolds that satisfy the axioms. We use the basic symmetries used in the proof of Theorem 1 to demonstrate the correctness for three dimensions, and suggest how the proof for higher dimensions would go."

Source : Computer Aided Surgery

Spider Web Architecture:

http://www.treehugger.com/files/2010/07/upcycled-speedo-pavilion-london.php