Thinning on the Cellular Complexes: Hexagonal and Quadratic.

dc.contributor.author	Trejo Martínez, Alfredo
dc.date.accessioned	2020-03-31T02:17:51Z
dc.date.available	2020-03-31T02:17:51Z
dc.date.issued	2016-03-02
dc.identifier.uri	http://ri.utn.edu.mx//handle/123456789/321
dc.description.abstract	This work is localized in two areas of the mathematics related with the processing of digital images, in particular with methods of complexes process or gridding for cells: digital topology and digital geometry. A proposed thinning algorithm in 2001 by Kovalevsky, to 2  dimensional binary digital images modelled for cellular complexes is experimented on the hexagonal and quadratic cellular complexes. To the hexagonal and quadratic complex the Kovalevsky algorithm is developed and implemented as a mapping method of patrons inside of this work. The skeletons or complexes obtained in several experiments are analyzed with reference to some topological and geometrical properties and are compared with the Blum complex.	es
dc.format	pdf	es
dc.language.iso	eng	es
dc.publisher	Journal of Mathematics	es
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0	es
dc.subject	Matemáticas	es
dc.subject.classification	Consecutiveness, digital topology, Grid cell topology, Hexagonal and quadratic cellular complexes, Kovalevsky complex, pixel, thinning algorithm.	es
dc.title	Thinning on the Cellular Complexes: Hexagonal and Quadratic.	es
dc.type	article	es
dc.identificator	Estadística	es
dc.rights.access	openAccess	es

Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-nd/4.0