The two dimensional tree algorithm

• The trunk algorithm
  • Draw a vertical (not entirely straight) line. The thickness of the line is directly depending on the number of branches it needs to support.
• The branch algorithm
  • A branch wants to extend into empty space (maximize entropy).
  • Draw a semi-horizontal line (sometimes straight and sometimes not straight) with one end attached to either a trunk or another branch.
  • The side of the branch attached to the trunk is aproximately twice as wide as the part extending into empty space.
• The leaf algorithm
  • A leaf is attached to a branch.
  • Draw a randomly shaped flat object that is about 1/8 of the size of the attached branch with one side turned up and one side turned down.
  • Connect the leaf with a line aproximately 1/8 of the size of the leaf to the branch.
• The root algorithm
  • A root is similiar to a branch in wanting to extend into empty space (empty space is where no part of the tree algorithm is already constructed).
  • Draw a more or less squigly line attached to the bottom of the trunk pointing downwards.
  • The side of the root attached to the trunk is about thrice the size of the part extending into empty space.