1-attempt parallel thinning

DOI10.1007/S10878-021-00744-YMaRDI QIDQ2084617zbMATH OpenOpenAlexFDO

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

Publication date 18 October 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-021-00744-y

zbMATH Keywords

\(k\)-attempt thinningdigital topologyskeletonizationthinning

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Review text

In this paper, the authors investigated a computationally efficient implementation scheme for 1-attempt thinning. Also, a 2D fully parallel thinning algorithm (acting on the conventional square grid) has been reported, and the authors showed that the suggested algorithm is 1-attempt.

Recommendations

• k-attempt thinning
• A parallel thinning algorithm with fine grain subtasking
• Equivalent sequential and parallel subiteration-based surface-thinning algorithms
• A noniterative thinning algorithm
• On topology preservation for triangular thinning algorithms

Cites work

• k-attempt thinning
• A 3D fully parallel surface-thinning algorithm
• Fixpoints of iterated reductions with equivalent deletion rules
• Topology preservation on the triangular grid
• Topology preserving parallel 3D thinning algorithms

Cited in

(3)

• k-attempt thinning
• An asynchronous thinning algorithm
• Similarity of 2D thinning algorithms and their k-attempt versions

This page was built for publication: 1-attempt parallel thinning

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