2006 19th Brazilian Symposium on Computer Graphics and Image Processing (2006)
Manaus, AM, Brazil
Oct. 8, 2006 to Oct. 11, 2006
M. Couprie , Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE
A. V. Saude , Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE
G. Bertrand , State University of Campinas, School of Electrical and Computer Engineering
Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. It allows to easily design parallel thinning algorithms which produce new types of skeletons, with specific geometrical properties, while guaranteeing their topological soundness. In this paper, we demonstrate that it is possible to define a skeleton based on the Euclidean distance, rather than on the common discrete distances, in the context of critical kernels. We provide the necessary definitions as well as an efficient algorithm to compute this skeleton.
A. V. Saude, M. Couprie and G. Bertrand, "Euclidean homotopic skeleton based on critical kernels," 2006 19th Brazilian Symposium on Computer Graphics and Image Processing(SIBGRAPI), Manaus, AM, Brazil, 2006, pp. 307-314.