<?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></authors><secondary-authors><author><style face="normal" font="default" size="100%">George Bebis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel 3D 12-Subiteration Thinning Algorithms Based on Isthmuses</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Visual Computing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><alt-title><style face="normal" font="default" size="100%">LNCS</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jul 2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">8033</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberg; New York</style></pub-location><pages><style face="normal" font="default" size="100%">87 - 98</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;Thinning is an iterative object reduction to obtain skeleton-like shape features of volumetric 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 accumulates isthmuses (i.e., generalization of curve and surface interior points as skeletal elements). This paper presents two parallel isthmus-based 3D thinning algorithms that are capable of producing centerlines and medial surfaces. The strategy which is used is called subiteration-based or directional: each iteration step is composed of 12 subiterations each of which are executed in parallel. The proposed algorithms make efficient implementation possible and their topological correctness is guaranteed.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&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%">Lecture Notes in Computer Science, Vol. 8033</style></notes></record></records></xml>