<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Srecko Brlek</style></author><author><style face="normal" font="default" size="100%">Christophe Reutenauer</style></author><author><style face="normal" font="default" size="100%">Xavier Provençal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Fully Parallel 3D Thinning Algorithms based on Sufficient Conditions for Topology Preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of Discrete Geometry for Computer Imagery (DGCI)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2009</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">5810</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Montreal, Quebec, Canada</style></pub-location><pages><style face="normal" font="default" size="100%">481 - 492</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-04396-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented. © 2009 Springer Berlin Heidelberg.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 77952414581doi: 10.1007/978-3-642-04397-0_41</style></notes></record></records></xml>