Sitemap
Sparisoma Viridi

Sparisoma Viridi

butiran-x.github.io

Root development simulation

Draft of the model in illustration

3 min readDec 9, 2023

--

Following previous brief literature study here, illustration to draft the model is presented in this story. It is advanced version of this but in text format.

Press enter or click to view image in full size

Convention

Air or upper part is on the left, while soil or lower part is on the right. For simplicity it uses only one character or one digit number for ID.

The development

Following are illustrations of the evolution.

Get Sparisoma Viridi’s stories in your inbox

Join Medium for free to get updates from this writer.

t = 0

      :
:
:
:
:
:
:
(x)--(0)--(1)
:
:
:
:
:
:
:

t = 1

      :
:
:
:
:
:
(x)--(0)--(1)
: \
: (2)
:
:
:
:

t = 2

      :
:
:
:
: (3)
: /
(x)--(0)--(1)
: \
: (2)
:
:
:
:

t = 3

      :
:
: (4)
: |
: (3)
: /
(x)--(0)--(1)
: \
: (2)
:
:
:
:

t = 4

      :
:
: (4)
: |
: (3)
: /
(x)--(0)--(1)
: \
: (2)
: |
: (5)
:
:

t = 5

      :
:
: (4)
: |
: (3)
: /
(x)--(0)--(1)
: \
: (2)
: |
: (5)--(6)
:
:

t = 6

      :
:
: (4)--(7)
: |
: (3)
: /
(x)--(0)--(1)
: \
: (2)
: |
: (5)--(6)
:
:

t = 7

      :
:
: (4)--(7)
: |
: (3)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
:
:

t = 8

      :
:
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
:
:

t = 9

      :       (A)
: /
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
:
:

t = 10

      :       (A)
: /
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
: \
: (B)

t = 11

      :       (A)
: /
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
: \ \
: (B) (C)

t = 12

      :       (A)  (D)
: / /
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
: \ \
: (B) (C)

t = 13

      :       (A)  (D)--(E)
: / /
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
: \ \
: (B) (C)

t = 14

      :       (A)  (D)--(E)
: / /
: (4)--(7)
: |
: (3)--(9)
: /
(x)--(0)--(1)
: \
: (2)--(8)
: |
: (5)--(6)
: \ \
: (B) (C)--(F)

And further more.

Formulation

How about the formulation? Any idea for the rule? Well, from previous illustration I try to design that the roots should not cross each other, which limit the use of |, \, — , and / as connector. Or simply ignore how to draw the connection, but only determine what connection types allowed based on previous connections that a node has.

Let’s use object to define a node. A node can have information about connector type between it and its parent. Then it can only has other connection types between it and its children. This simple rule is to assure that a child node does not overlap with its grandparent node.

There is also other problem beside connection types, that is, connection directions. The simplest way is to assume that child node is always below the parent node. This means the connection directions can be guaranteed.

A random number can be used to determine which connection type for the child node and check whether the parent already has the type. Then one problem is still left, which is the overlap between child nodes, since there have been yet any rule to assure to prevent this.

Update for this story will be added later, e.g. link to the other story continuing this in formulating the model.

--

--