Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Universidad Nacional Autónoma de México
2011
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=47419293003 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Plane-and Space-Filling Trees by Means of Chain Coding E. Bribiesca N. Espinosa-Dominguez Ingeniería plane space chain coding Fractal trees filling trees An algorithm for constructing fractal trees is presented. Fractal trees are represented by means of the notation called the unique 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 a chain of base-five digit strings suitably combined by means of parentheses. The unique tree-descriptor notation is invariant under rotation and translation. Furthermore, using this descriptor it is possible to obtain the mirror image of any fractal tree with ease. In this paper, we focus on fractal plane-filling trees and space-filling trees. 2011 artículo científico 1665-6423 https://www.redalyc.org/articulo.oa?id=47419293003 en http://www.redalyc.org/revista.oa?id=474 Journal of Applied Research and Technology application/pdf Universidad Nacional Autónoma de México Journal of Applied Research and Technology (México) Num.2 Vol.9