@inbook {959,
	title = {Parallel Thinning Algorithms Based on Ronse{\textquoteright}s Sufficient Conditions for Topology Preservation},
	booktitle = {Progress in Combinatorial Image Analysis},
	year = {2010},
	month = {May 2010},
	pages = {183 - 194},
	publisher = {Scientific Research Publishing Inc.},
	organization = {Scientific Research Publishing Inc.},
	type = {Book chapter},
	address = {Singapore},
	url = {http://rpsonline.com.sg/rpsweb/iwcia09.html},
	author = {G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi},
	editor = {Petra Wiederhold and Reneta P Barneva}
}
@inbook {868,
	title = {An order-independent sequential thinning algorithm},
	booktitle = {Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA)},
	number = {5852},
	year = {2009},
	note = {ScopusID: 78650496028doi: 10.1007/978-3-642-10210-3_13},
	month = {Nov 2009},
	pages = {162 - 175},
	publisher = {Springer Verlag},
	organization = {Springer Verlag},
	type = {Conference paper},
	address = {Playa del Carmen, Mexico},
	abstract = {<p>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.</p>},
	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 = {<p>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.</p>},
	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}
}
