01225nas a2200205 4500008004100000245005500041210005500096260005200151300001400203490000900217520059400226100002000820700002300840700002500863700002200888700001700910700002100927700002000948856005100968 2012 eng d00a3D Parallel Thinning Algorithms Based on Isthmuses0 a3D Parallel Thinning Algorithms Based on Isthmuses aBrno, Czech RepublicbSpringer VerlagcSep 2012 a325 - 3350 v75173 a
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.
1 aNémeth, Gábor1 aPalágyi, Kálmán1 aBlanc-Talon, Jacques1 aPhilips, Wilfried1 aPopescu, Dan1 aScheunders, Paul1 aZemčík, Pavel uhttp://dx.doi.org/10.1007/978-3-642-33140-4_2900565nas a2200145 4500008004100000245009800041210006900139260006100208300001400269100002000283700002300303700002200326700002300348856004800371 2010 eng d00aParallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation0 aParallel Thinning Algorithms Based on Ronses Sufficient Conditio aSingaporebScientific Research Publishing Inc.cMay 2010 a183 - 1941 aNémeth, Gábor1 aPalágyi, Kálmán1 aWiederhold, Petra1 aBarneva, Reneta, P uhttp://rpsonline.com.sg/rpsweb/iwcia09.html