Abstract
An algorithm for constructing fractal trees is presented. Fractal trees are represented by means of the notation called theunique tree descriptor [E. Bribiesca, A method for representing 3D tree objects using chain coding, J. Vis. Commun.Image R. 19 (2008) 184-198]. In this manner, we only have a one-dimensional representation by each fractal tree via achain of base-five digit strings suitably combined by means of parentheses. The unique tree-descriptor notation isinvariant under rotation and translation. Furthermore, using this descriptor it is possible to obtain the mirror image of anyfractal tree with ease. In this paper, we focus on fractal plane-filling trees and space-filling trees.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
