01140nas a2200157   4500008004100000020002300041245004500064210004500109260002900154300001400183520063300197100001900830700002300849700002000872856009000892       2013                        eng d  a978-1-4799-1543-9 00aParallel Thinning on the Triangular Grid0 aParallel Thinning on the Triangular Grid  aBudapestbIEEEcDec 2013  a277 - 2823 a<p>One of the fundamental issues of human and computational cognitive psychology is pattern or shape recognition. Various applications in image processing and computer vision rely on skeleton-like shape features A possible technique for extracting these feautures is thinning. Although the majority of 2D thinning algorithms work on digital pictures sampled onthe conventional square grid, the role of some non-conventional grids, like the hexagonal and triangular grid, are of increasing importance as well. In this paper we propose numerous topolgy preserving parallel thinning algorithms that work on the triangular grid.</p>1 aKardos, Péter1 aPalágyi, Kálmán1 aBaranyi, Péter  uhttps://tisat.inf.u-szeged.hu/en/publication/parallel-thinning-on-the-triangular-grid