Plane-and Space-Filling Trees by Means of Chain Coding
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 on...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | México |
| Institución: | UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO |
| Repositorio: | Journal of Applied Research and Technology |
| Idioma: | inglés |
| OAI Identifier: | oai:ojs2.localhost:article/442 |
| Acceso en línea: | https://jart.icat.unam.mx/index.php/jart/article/view/442 |
| Access Level: | acceso abierto |
| Palabra clave: | Fractal trees tree descriptor plane-filling trees space-filling trees chain coding. arboles fractales codificado de arboles cadena de codificacion |
| Sumario: | 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. |
|---|