Abstract
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A′, such that A′ deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palágyi and Kuba (Graphical Models Image Process. 61 (1999) 199).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.