Topology preservation is the key concept in parallel thinning algorithms on any sampling schemes. This paper establishes some sufficient conditions for parallel thinning algorithms working on hexagonal grids (or triangular lattices) to preserve topology. By these results, various thinning (and shrinking to a residue) algorithms can be verified. To illustrate the usefulness of our sufficient conditions, we propose a new parallel thinning algorithm and prove its topological correctness. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kardos, P., & Palágyi, K. (2011). On topology preservation for hexagonal parallel thinning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6636 LNCS, pp. 31–42). https://doi.org/10.1007/978-3-642-21073-0_6
Mendeley helps you to discover research relevant for your work.