Thinning on the Cellular Complexes: Hexagonal and Quadratic.
Trejo Martínez, Alfredo
MetadatosMostrar el registro completo del ítem
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.