Thinning is a frequently used method for extracting skeletons of objects in discrete spaces. It is a layer by layer erosion of the objects until only their skeletons are left. This paper presents an efficient parallel thinning algorithm which directly extracts medial lines from 3D binary objects (i.e., without creating medial surface). According to the selected 12 deletion directions, one iteration step contains 12 subiterations (instead of the usual 6). Our algorithm provides good results, preserves topology and makes easy implementation possible.
CITATION STYLE
Palágyi, K., & Kuba, A. (1997). A parallel 12-subiteration 3D thinning algorithm to extract medial lines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1296, pp. 400–407). Springer Verlag. https://doi.org/10.1007/3-540-63460-6_143
Mendeley helps you to discover research relevant for your work.