On topology preservation for triangular thinning algorithms

Péter Kardos, Kálmán Palágyi

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

10 Citations (Scopus)

Abstract

Thinning is a frequently used strategy to produce skeleton-like shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algorithms working on triangular grids (or hexagonal lattices) to preserve topology.

Original languageEnglish
Title of host publicationCombinatorial Image Analysis - 15th International Workshop, IWCIA 2012, Proceedings
Pages128-142
Number of pages15
DOIs
Publication statusPublished - Nov 30 2012
Event15th International Workshop on Combinatorial Image Analysis, IWCIA 2012 - Austin, TX, United States
Duration: Nov 28 2012Nov 30 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7655 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Workshop on Combinatorial Image Analysis, IWCIA 2012
CountryUnited States
CityAustin, TX
Period11/28/1211/30/12

    Fingerprint

Keywords

  • Thinning
  • Topology preservation
  • Triangular grids

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kardos, P., & Palágyi, K. (2012). On topology preservation for triangular thinning algorithms. In Combinatorial Image Analysis - 15th International Workshop, IWCIA 2012, Proceedings (pp. 128-142). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7655 LNCS). https://doi.org/10.1007/978-3-642-34732-0_10