Abstract

A thinning algorithm must `preserve topology,' but in the case of a parallel thinning algorithm it can be hard to prove that it does so. Ronse has given sufficient conditions which can be used to simplify such proofs in the 2D case. By Ronse's results, the fact that a parallel thinning algorithm is topology preserving can be verified by checking only a rather small number of configurations. This paper introduces Ronse-like sufficient conditions for 3D binary images.

Full Text
Paper version not known

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 call

Disclaimer: 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.