Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of this framework, and we derive a general methodology for designing parallel algorithms for skeletons of objects in 3D grids. In fact, this methodology does not need to handle the structure of abstract complexes, we show that only 3 masks defined in the classical cubic grid are sufficient to implement it. We illustrate our methodology by giving two new types of skeletons. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bertrand, G., & Couprie, M. (2006). A new 3D parallel thinning scheme based on critical kernels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4245 LNCS, pp. 580–591). Springer Verlag. https://doi.org/10.1007/11907350_49
Mendeley helps you to discover research relevant for your work.