Abstract
Thinning is a process which erodes an object layer by layer until only a skeleton is left. A thinning algorithm should preserve connectivity; i.e., any object and its skeleton should maintain the same connectivity structure. This paper concerns the connectivity preservation of 3D 6-subiteration thinning algorithms. The first objective of this paper is to propose sufficient conditions so that any 3D 6-subiteration parallel thinning algorithm satisfying these conditions is guaranteed to preserve connectivity. Even with these sufficient conditions, it is still not very easy to prove the connectivity soundness of a 3D 6-subiteration thinning algorithm. Thus, the second objective of this paper is to propose an approach to computerize the above sufficient conditions. Any 3D 6-subiteration thinning algorithm passing the computerized tests is guaranteed to preserve connectivity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
