A 3–Subiteration Surface–Thinning Algorithm

Palágyi, Kálmán

doi:10.1007/978-3-540-74272-2_78

Cited by 4 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the surface end-point criterion used, the skeleton produced may contain 2-point thick surface patches [2,27,38,39]. Fortunately it is not hard to overcome this problem here (e.g.…”

Section: Discussionmentioning

confidence: 97%

See 2 more Smart Citations

A 3D fully parallel surface-thinning algorithm

Palágyi

2008

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

a b s t r a c tThe 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.

show abstract

“…Due to the surface end-point criterion used, the skeleton produced may contain 2-point thick surface patches [2,27,38,39]. Fortunately it is not hard to overcome this problem here (e.g.…”

Section: Discussionmentioning

confidence: 97%

“…Note that the same characterization has been applied as well in other thinning algorithms [2,27,38,39].…”

Section: The New Thinning Algorithmmentioning

confidence: 88%

See 1 more Smart Citation

A 3D fully parallel surface-thinning algorithm

Palágyi

2008

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Note that due to the considered types of surface end-points, our medial surfaces may contain 2-point thick surface patches [1,15,16,17]. Fortunately, it is not hard to overcome this problem here (e.g.…”

Section: There Is No Interior Point In the Setmentioning

confidence: 99%

“…Note that surface-end points of type 1 are considered by some existing 3D surface-thinning algorithms [1,15,16,17] and all the three types are used by the algorithms proposed by Manzanera et al [13].…”

Section: There Is No Interior Point In the Setmentioning

confidence: 99%

Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation

Palágyi

Németh

2009

Discrete Geometry for Computer Imagery

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26, 6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented.

show abstract

Isthmus-Based 6-Directional Parallel Thinning Algorithms

Couprie¹

2011

Discrete Geometry for Computer Imagery

View full text Add to dashboard Cite

Skeletons are widely used in pattern recognition and image analysis. A way to obtain skeletons is the thinning approach, consisting in iteratively removing points from the object without changing the topology. In order to preserve geometric information, it is usual to preserve curve end points (for curve skeletons) or surface end points (for surface skeletons). In this paper we propose a new fast directional parallel thinning scheme, preserving isthmuses (a generalization of curve/surface interior points), and providing skeletons with low amount of noise. We also prove the topology preservation of our approach.

show abstract

A 3–Subiteration Surface–Thinning Algorithm

Cited by 4 publications

References 14 publications

A 3D fully parallel surface-thinning algorithm

A 3D fully parallel surface-thinning algorithm

Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation

Isthmus-Based 6-Directional Parallel Thinning Algorithms

Contact Info

Product

Resources

About