We propose a new generic sequential thinning scheme based on the critical kernels framework. From this scheme, we derive sequential algorithms for obtaining ultimate skeletons and curve skeletons. We prove some properties of these algorithms, and we provide the results of a quantitative evaluation that compares our algorithm for curve skeletons with both sequential and parallel ones.
CITATION STYLE
Couprie, M., & Bertrand, G. (2015). A 3d sequential thinning scheme based on critical kernels. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9082, 549–560. https://doi.org/10.1007/978-3-319-18720-4_46
Mendeley helps you to discover research relevant for your work.