@article {975,
	title = {Topology-preserving hexagonal thinning},
	journal = {INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS},
	volume = {90},
	year = {2013},
	note = {doi: 10.1080/00207160.2012.724198},
	month = {2013},
	pages = {1607 - 1617},
	publisher = {Taylor \& Francis},
	type = {Journal article},
	abstract = {<p>Thinning is a well-known technique for producing skeleton-like shape features from digital binary objects in a topology-preserving way. Most of the existing thinning algorithms work on input images that are sampled on orthogonal grids; however, it is also possible to perform thinning on hexagonal grids (or triangular lattices). In this paper, we point out to the main similarities and differences between the topological properties of these two types of sampling schemes. We give various characterizations of simple points and present some new sufficient conditions for topology-preserving reductions working on hexagonal grids.</p>},
	isbn = {0020-7160},
	doi = {10.1080/00207160.2012.724198},
	url = {http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.724198$\#$preview},
	author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}
}
