Equivalent sequential and parallel subiteration-based surface-thinning algorithms

DOI10.1007/978-3-319-26145-4_3MaRDI QIDQ2794622zbMATH OpenOpenAlexFDO

Authors Kálmán Palágyi, Gábor Németh, Péter Kardos

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26145-4_3

zbMATH Keywords

discrete geometrydiscrete topologyequivalent thinning algorithmsskeletonssubiteration-based thinning

Mathematics Subject Classification ID

Computational aspects of digital topology (68U03) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Online algorithms; streaming algorithms (68W27)

Recommendations

• A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms
• Equivalent 2D sequential and parallel thinning algorithms
• A 3D fully parallel surface-thinning algorithm
• scientific article; zbMATH DE number 2079743
• A Family of Topology–Preserving 3D Parallel 6–Subiteration Thinning Algorithms

Cited in

(4)

• 1-attempt parallel thinning
• Equivalent 2D sequential and parallel thinning algorithms
• A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms
• Fixpoints of iterated reductions with equivalent deletion rules

This page was built for publication: Equivalent sequential and parallel subiteration-based surface-thinning algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794622)