@article {916,
	title = {A 3D fully parallel surface-thinning algorithm},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {406},
	year = {2008},
	note = {UT: 000260289400014ScopusID: 51749087902doi: 10.1016/j.tcs.2008.06.041},
	month = {Oct 2008},
	pages = {119 - 135},
	publisher = {Elsevier},
	type = {Journal article},
	address = {AHUJA 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, },
	abstract = {<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. {\textcopyright} 2008 Elsevier B.V. All rights reserved.</p>},
	isbn = {0304-3975},
	doi = {10.1016/j.tcs.2008.06.041},
	author = {K{\'a}lm{\'a}n Pal{\'a}gyi}
}
