top of page


Screenshot 2019-01-20 at 23.05.25.png

Programming for Design | Fall 2018

Lead by Martyn Dade-Robertson

How the branches get attracted by dots?

Looking for the closest branch...

Screenshot 2019-01-21 at 22.48.02.png
Screenshot 2019-01-20 at 21.03.45.png
Screenshot 2019-01-20 at 21.03.10.png

The process of mycelium growth  

The "Space Colonisation" Algorithm works by starting with a shape and then generating branches to fill it. 

1. Attraction Points
     1.1. Location
2. Branches (Segments)
     2.1. First branch 
     2.2. Parent
     2.3. Location
     2.4. Direction 
     2.5. Count 
     2.6. Distance
     2.7. Length


(a) Each attraction point is associated with the tree node that is closest to it.

(b) This establishes the set of attraction points that influence each node. (Min_dist)

(c) The normalised vectors from each tree node to each source that influences the node are then found.

(d) These vectors are added and their sum is normalized again, providing the basis for locating new tree nodes.

(e) The new nodes are incorporated into the tree structure, in this case extending the main axis and initiating a lateral branch. 

(f) The neighbourhoods of the attraction points are now tested for the inclusion of tree nodes. 

(g) The neighbourhoods of the two leftmost sources have been penetrated by the new branches. Thus, the affected attraction points are removed. 

(h) The tree nodes closest to these points are now identified. Beginning the next iteration of the algorithm. 

All Videos
Search video...
Comp 1_1
Play Video
bottom of page