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...

Descripción completa

Detalles Bibliográficos
Autores: Bribiesca, E., Espinosa-Dominguez, N.
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
id MX_2b8fea1f8d5617849f4e1f1bd7b4147a
oai_identifier_str oai:ojs2.localhost:article/442
network_acronym_str MX
network_name_str México
repository_id_str
spelling Plane-and Space-Filling Trees by Means of Chain CodingPlane-and Space-Filling Trees by Means of Chain CodingBribiesca, E.Espinosa-Dominguez, N.Fractal treestree descriptorplane-filling treesspace-filling treeschain coding.arboles fractalescodificado de arbolescadena de codificacionAn 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.Se presenta un algoritmo para la construcción de árboles fractales. Un árbol fractal es representado por medio de lanotación llamada descriptor único de árboles [E. Bribiesca, A method for representing 3D tree objects using chaincoding, J. Vis. Commun. Image R. 19 (2008) 184-198]. De esta manera, se tiene solamente una representaciónunidimensional para cada árbol fractal por medio de una cadena de digitos de base cinco adecuadamente combinadospor medio de paréntesis. La notación del descriptor único de árboles es invariante bajo rotación y traslación. Además,usando este descriptor es posible obtener la imagen especular de cualquier árbol fractal con facilidad. El contenido deeste artículo se enfoca en el estudio de los árboles fractales que cubren el plano y el espacio.Universidad Nacional Autónoma de México2011-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionPeer-reviewed Articleapplication/pdfhttps://jart.icat.unam.mx/index.php/jart/article/view/44210.22201/icat.16656423.2011.9.02.442Journal of Applied Research and Technology; Vol. 9 No. 02Journal of Applied Research and Technology; Vol. 9 Núm. 022448-67361665-642310.22201/icat.24486736e.2011.9.02reponame:Journal of Applied Research and Technologyinstname:UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICOinstacron:UNAMenghttps://jart.icat.unam.mx/index.php/jart/article/view/442/438Copyright (c) 2018 Journal of Applied Research and Technologyinfo:eu-repo/semantics/openAccessoai:ojs2.localhost:article/4422024-08-16T17:54:15Z
dc.title.none.fl_str_mv Plane-and Space-Filling Trees by Means of Chain Coding
Plane-and Space-Filling Trees by Means of Chain Coding
title Plane-and Space-Filling Trees by Means of Chain Coding
spellingShingle Plane-and Space-Filling Trees by Means of Chain Coding
Bribiesca, E.
Fractal trees
tree descriptor
plane-filling trees
space-filling trees
chain coding.
arboles fractales
codificado de arboles
cadena de codificacion
title_short Plane-and Space-Filling Trees by Means of Chain Coding
title_full Plane-and Space-Filling Trees by Means of Chain Coding
title_fullStr Plane-and Space-Filling Trees by Means of Chain Coding
title_full_unstemmed Plane-and Space-Filling Trees by Means of Chain Coding
title_sort Plane-and Space-Filling Trees by Means of Chain Coding
dc.creator.none.fl_str_mv Bribiesca, E.
Espinosa-Dominguez, N.
author Bribiesca, E.
author_facet Bribiesca, E.
Espinosa-Dominguez, N.
author_role author
author2 Espinosa-Dominguez, N.
author2_role author
dc.subject.none.fl_str_mv Fractal trees
tree descriptor
plane-filling trees
space-filling trees
chain coding.
arboles fractales
codificado de arboles
cadena de codificacion
topic Fractal trees
tree descriptor
plane-filling trees
space-filling trees
chain coding.
arboles fractales
codificado de arboles
cadena de codificacion
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-08-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://jart.icat.unam.mx/index.php/jart/article/view/442
10.22201/icat.16656423.2011.9.02.442
url https://jart.icat.unam.mx/index.php/jart/article/view/442
identifier_str_mv 10.22201/icat.16656423.2011.9.02.442
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://jart.icat.unam.mx/index.php/jart/article/view/442/438
dc.rights.none.fl_str_mv Copyright (c) 2018 Journal of Applied Research and Technology
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2018 Journal of Applied Research and Technology
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidad Nacional Autónoma de México
publisher.none.fl_str_mv Universidad Nacional Autónoma de México
dc.source.none.fl_str_mv Journal of Applied Research and Technology; Vol. 9 No. 02
Journal of Applied Research and Technology; Vol. 9 Núm. 02
2448-6736
1665-6423
10.22201/icat.24486736e.2011.9.02
reponame:Journal of Applied Research and Technology
instname:UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO
instacron:UNAM
instname_str UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO
instacron_str UNAM
institution UNAM
reponame_str Journal of Applied Research and Technology
collection Journal of Applied Research and Technology
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1858174764606029824
score 15,812455

Similares en LA Referencia