<?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%">Gábor Németh</style></author><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%">Petra Wiederhold</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Progress in Combinatorial Image Analysis</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 2010</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://rpsonline.com.sg/rpsweb/iwcia09.html</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Scientific Research Publishing Inc.</style></publisher><pub-location><style face="normal" font="default" size="100%">Singapore</style></pub-location><pages><style face="normal" font="default" size="100%">183 - 194</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Book chapter</style></work-type></record><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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><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%">Petra Wiederhold</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An order-independent sequential thinning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA)</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%">Nov 2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5852</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Playa del Carmen, Mexico</style></pub-location><pages><style face="normal" font="default" size="100%">162 - 175</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-10208-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting orders and it is capable of extracting maximally thinned skeletons. © Springer-Verlag Berlin Heidelberg 2009.&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: 78650496028doi: 10.1007/978-3-642-10210-3_13</style></notes></record><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%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Petra Wiederhold</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis</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%">Nov 2009</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">5852</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; Heidelberg; New York; London; Paris; Tokyo</style></pub-location><pages><style face="normal" font="default" size="100%">280 - 288</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-10208-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The problem of reconstructing some special hv-convex discretesets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class - the class of hv-convex canonical discrete sets - and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well. © Springer-Verlag Berlin Heidelberg 2009.&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%">UT: 000279344100022ScopusID: 78650444641doi: 10.1007/978-3-642-10210-3_22</style></notes></record></records></xml>