ACADEMIC RESEARCH AND PUBLICATIONS
during Graduate and Undergraduate Studies
Doctoral Candidate in Computer Science
Visual Computing Division, Digital Production Arts
Clemson University | School of Computing
FRACTAL DESIGNS PROJECT:
RECURSIVE ALGORITHMS
Fractal Tree (random angles)
Fractal Tree (no random angles)
Fractal Fern
PROJECT PAGE
I'm a paragraph. Click here to add your own text and edit me. It’s easy. Just click “Edit Text” or double click me to add your own content and make changes to the font. I’m a great place for you to tell a story and let your users know a little more about you.
Language: Python
Date: Spring 2015
Class: Data Structures
This coding project is written in Python using Python Turtle graphics to visualize recursion. The fractal algorithms were implemented via the creation and traversal of binary trees.
The first two images are fractal trees. The first introduces a slightly varying angle per node of the tree when a section branches into two children. The second image keeps a fixed angle at each split. The last image is a fractal fern, a small angle change at each increment helping the formation of gradual curves.