01477nas a2200205   4500008004500000020002200045245009700067210006900164260003600233300001200269520073500281100002301016700002001039700001901059700001601078700001401094700001401108700001601122856013301138       2015                        engldsh    a978-1-4673-8032-400aTopology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms0 aTopologyPreserving Equivalent Parallel and Sequential 4Subiterat  aZagreb, CroatiabIEEEc2015 Sep  a304-3093 a<p>Thinning is a frequently applied technique for extracting centerlines from 2D binary objects. Parallel thinning algorithms can remove a set of object points simultaneously, while sequential algorithms traverse the boundary of objects, and consider the actually visited single point for possible removal. Two thinning algorithms are called equivalent if they produce the same result for each input picture. This paper presents the very first pair of equivalent 2D sequential and parallel subiteration-based thinning algorithms. These algorithms can be implemented directly on a conventional sequential computer or on a parallel computing device. Both of them preserve topology for (8, 4) pictures sampled on the square grid.</p>1 aPalágyi, Kálmán1 aNémeth, Gábor1 aKardos, Péter1 aLoncaric, S1 aLerski, D1 aEskola, H1 aBregovic, R  uhttps://inf.u-szeged.hu/publication/topology-preserving-equivalent-parallel-and-sequential-4-subiteration-2d-thinning-algorithms