### Abstract

The thinning is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved.

Original language | English |
---|---|

Pages (from-to) | 119-135 |

Number of pages | 17 |

Journal | Theoretical Computer Science |

Volume | 406 |

Issue number | 1-2 |

DOIs | |

Publication status | Published - Oct 28 2008 |

### Fingerprint

### Keywords

- Digital topology
- Discrete geometry
- Skeleton
- Thinning algorithms
- Topology preservation

### ASJC Scopus subject areas

- Computational Theory and Mathematics

### Cite this

*Theoretical Computer Science*,

*406*(1-2), 119-135. https://doi.org/10.1016/j.tcs.2008.06.041

**A 3D fully parallel surface-thinning algorithm.** / Palágyi, K.

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 406, no. 1-2, pp. 119-135. https://doi.org/10.1016/j.tcs.2008.06.041

}

TY - JOUR

T1 - A 3D fully parallel surface-thinning algorithm

AU - Palágyi, K.

PY - 2008/10/28

Y1 - 2008/10/28

N2 - The thinning is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved.

AB - The thinning is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved.

KW - Digital topology

KW - Discrete geometry

KW - Skeleton

KW - Thinning algorithms

KW - Topology preservation

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

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

U2 - 10.1016/j.tcs.2008.06.041

DO - 10.1016/j.tcs.2008.06.041

M3 - Article

VL - 406

SP - 119

EP - 135

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -