<?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%">Péter Kardos</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%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Jake K Aggarwal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On topology preservation for triangular thinning algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis (IWCIA)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><short-title><style face="normal" font="default" size="100%">LNCS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">7655</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Austin, TX, USA</style></pub-location><pages><style face="normal" font="default" size="100%">128 - 142</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-34731-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;Thinning is a frequently used strategy to produce skeleton-like shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algorithms working on triangular grids (or hexagonal lattices) to preserve topology.&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%">doi: 10.1007/978-3-642-34732-0_10Lecture Notes in Computer Science, Volume 7655</style></notes></record></records></xml>