Procedural Tree Generator

This project was created while I was learning recursion and procedural generation techniques in Python.

The initial idea came from a simple question: If I teach a computer how to draw a tree and each generated tree is unique, who should be considered the artist, the programmer or the machine?

To explore this idea, I developed a recursive algorithm that generates organic-looking trees through randomized branching angles, variable branch lengths, and probabilistic growth rules.

The recursive process is controlled by progressively reducing branch length. Once branches become sufficiently short, the algorithm switches to leaf generation, guaranteeing termination.

The implementation prioritizes visual complexity over execution speed and was developed primarily as an exercise in recursion and procedural generation.

As you can see from the examples below, some trees appear more natural than others, regardless of the time required to generate them. During testing, I observed little correlation between execution time and the visual quality of the generated tree.

Because of the apparent lack of correlation between execution time and visual quality, a possible future improvement would be to introduce a time limit of 200 seconds, preventing excessively long generation times.