I have started implementing the final feature of the L-system which is to grow multiple trees simultaneously.
A linked list is created for each tree. In each list are pointers to structures used to generate the tree. There are still some bugs in the implementation which cause the lists to not draw correctly which causes frequent crashes. Figure 1 shows the greatest complexity currently achieved.
A linked list is created for each tree. In each list are pointers to structures used to generate the tree. There are still some bugs in the implementation which cause the lists to not draw correctly which causes frequent crashes. Figure 1 shows the greatest complexity currently achieved.