Thinning is a widely used technique to obtain skeleton-like shape features (i.e., centerlines and medial surfaces) from digital binary objects. Conventional thinning algorithms preserve endpoints to provide important geometric information relative to the object to be represented. An alternative strategy is also proposed that preserves isthmuses (i.e., generalization of curve/surface interior points). In this paper we present ten 3D parallel isthmus-based thinning algorithm variants that are derived from some sufficient conditions for topology preserving reductions. © 2012 Springer-Verlag.
CITATION STYLE
Németh, G., & Palágyi, K. (2012). 3D parallel thinning algorithms based on isthmuses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7517 LNCS, pp. 325–335). https://doi.org/10.1007/978-3-642-33140-4_29
Mendeley helps you to discover research relevant for your work.