< Back to Article

One Rule to Grow Them All: A General Theory of Neuronal Branching and Its Practical Application

Figure 2

Generating neuronal branching structures using optimized graphs.

(A) The growth described by an extended minimum spanning tree algorithm (see text). Unconnected carrier points (red) are connected one by one to the nodes of a tree (black). Red dashed lines indicate three sample Euclidean distances to the nodes of the tree for sample point P. (B) Example trees grown on homogeneously distributed random carrier points in a circular hull starting from a root located at its centre (see top). Plotted as a function of the balancing factor bf, the trees range from perfect minimum spanning trees (left) to almost direct connections from the root to any point (right).

Figure 2