01261nas a2200145   4500008004100000020001400041245005100055210004800106260027600154300001400430490000800444520055300452100002301005856008701028       2008                        eng d  a0304-397500aA 3D fully parallel surface-thinning algorithm0 a3D fully parallel surfacethinning algorithm  aAHUJA N, 1997, IEEE T PATTERN ANAL, V19, P169ARCELLI C, 2006, LECT NOTES COMPUT SC, V4245, P555BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, CR ACAD SCI I-MATH, V321, P1077BERTRAND G, 1995, P 5 INT C DISCR GEOM, P233BERTRAND G, bElseviercOct 2008  a119 - 1350 v4063 a<p>The thinning is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved. © 2008 Elsevier B.V. All rights reserved.</p>1 aPalágyi, Kálmán  uhttps://inf.u-szeged.hu/publication/a-3d-fully-parallel-surface-thinning-algorithm