1-attempt parallel thinning (Q2084617): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-021-00744-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-021-00744-Y / rank | |||
Normal rank | |||
Latest revision as of 00:24, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 1-attempt parallel thinning |
scientific article |
Statements
1-attempt parallel thinning (English)
0 references
18 October 2022
0 references
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.
0 references
digital topology
0 references
skeletonization
0 references
thinning
0 references
\(k\)-attempt thinning
0 references
