On topology preservation for hexagonal parallel thinning algorithms

Péter Kardos, K. Palágyi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages31-42
Number of pages12
Volume6636 LNCS
DOIs
Publication statusPublished - 2011
Event14th International Workshop on Combinatorial Image Analysis, IWCIA 2011 - Madrid, Spain
Duration: May 23 2011May 25 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6636 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other14th International Workshop on Combinatorial Image Analysis, IWCIA 2011
CountrySpain
CityMadrid
Period5/23/115/25/11

Fingerprint

Topology Preservation
Thinning
Hexagon
Topology
Sufficient Conditions
Triangular Lattice
Shrinking
Correctness
Sampling
Grid

Keywords

  • hexagonal grids
  • parallel reduction operators
  • thinning
  • topology preservation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

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). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6636 LNCS). https://doi.org/10.1007/978-3-642-21073-0_6

On topology preservation for hexagonal parallel thinning algorithms. / Kardos, Péter; Palágyi, K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6636 LNCS 2011. p. 31-42 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6636 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6636 LNCS, pp. 31-42, 14th International Workshop on Combinatorial Image Analysis, IWCIA 2011, Madrid, Spain, 5/23/11. https://doi.org/10.1007/978-3-642-21073-0_6
Kardos P, Palágyi K. 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. 2011. p. 31-42. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-21073-0_6
Kardos, Péter ; Palágyi, K. / On topology preservation for hexagonal parallel thinning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6636 LNCS 2011. pp. 31-42 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fbdd504eed724d16a528d06f0fa6b274,
title = "On topology preservation for hexagonal parallel thinning algorithms",
abstract = "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.",
keywords = "hexagonal grids, parallel reduction operators, thinning, topology preservation",
author = "P{\'e}ter Kardos and K. Pal{\'a}gyi",
year = "2011",
doi = "10.1007/978-3-642-21073-0_6",
language = "English",
isbn = "9783642210723",
volume = "6636 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "31--42",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On topology preservation for hexagonal parallel thinning algorithms

AU - Kardos, Péter

AU - Palágyi, K.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - hexagonal grids

KW - parallel reduction operators

KW - thinning

KW - topology preservation

UR - http://www.scopus.com/inward/record.url?scp=79957628214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79957628214&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-21073-0_6

DO - 10.1007/978-3-642-21073-0_6

M3 - Conference contribution

AN - SCOPUS:79957628214

SN - 9783642210723

VL - 6636 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 31

EP - 42

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -