Show simple item record

dc.contributor.authorTrejo Martínez, Alfredo
dc.date.accessioned2020-03-31T02:17:51Z
dc.date.available2020-03-31T02:17:51Z
dc.date.issued2016-03-02
dc.identifier.urihttp://ri.utn.edu.mx//handle/123456789/321
dc.description.abstractThis 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.formatpdfes
dc.language.isoenges
dc.publisherJournal of Mathematicses
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0es
dc.subjectMatemáticases
dc.subject.classificationConsecutiveness, digital topology, Grid cell topology, Hexagonal and quadratic cellular complexes, Kovalevsky complex, pixel, thinning algorithm.es
dc.titleThinning on the Cellular Complexes: Hexagonal and Quadratic.es
dc.typearticlees
dc.identificatorEstadísticaes
dc.rights.accessopenAccesses


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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