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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2009.

}, isbn = {978-3-642-10208-0}, doi = {10.1007/978-3-642-10210-3_13}, url = {http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13}, author = {P{\'e}ter Kardos and G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Petra Wiederhold and Reneta P Barneva} } @inbook {1134, title = {Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections}, booktitle = {Combinatorial Image Analysis}, number = {5852}, year = {2009}, note = {UT: 000279344100022ScopusID: 78650444641doi: 10.1007/978-3-642-10210-3_22}, month = {Nov 2009}, pages = {280 - 288}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Berlin; Heidelberg; New York; London; Paris; Tokyo}, abstract = {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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2009.

}, isbn = {978-3-642-10208-0}, doi = {10.1007/978-3-642-10210-3_22}, author = {P{\'e}ter Bal{\'a}zs}, editor = {Petra Wiederhold and Reneta P Barneva} }