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.

%B Combinatorial Image Analysis (IWCIA) %S Lecture Notes in Computer Science %I Springer Verlag %C Austin, TX, USA %P 128 - 142 %8 Nov 2012 %@ 978-3-642-34731-3 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-34732-0_10