On the deletability of points in 3D thinning
- First Online:
- Cite this paper as:
- Watzel R., Braun K., Hess A., Scheich H., Zuschratter W. (1995) On the deletability of points in 3D thinning. In: Chin R.T., Ip H.H.S., Naiman A.C., Pong TC. (eds) Image Analysis Applications and Computer Graphics. ICSC 1995. Lecture Notes in Computer Science, vol 1024. Springer, Berlin, Heidelberg
An appropriate description of the shape of objects is essential for image analysis and understanding. A well known approach to this is the concept of skeleton. This paper considers a parallel thinning algorithm to compute the skeleton in 3D and proposes a new deletability criterion which retains points whose deletion depends on the deletion of their neighbors. The criterion is incorporated by filling components in a 3×3×3 window.
Unable to display preview. Download preview PDF.