Abstract
The recognition of digital shapes is a deeply studied problem. The arithmetical framework, initiated by J.P. Reveilles in [1], provides a great theoretical basis, as well as many algorithms to deal with discrete objects. Among the many available tools, the tangential cover is a powerful one. First presented in [2], it computes the set of all maximal segments of a digital curve and allows either to obtain minimal length polygonalization, or asymptotic convergence of tangent estimations. Nevertheless, the arithmetical approach does not tolerate the introduction of irregularities, which are however inherent to the acquisition of digital shapes. In this paper, we propose a new definition for a class of so-called digital that applies well to a large class of discrete objects boundaries. We then propose an extension of the tangential cover to thick digital curves and provide an algorithm with a O(n log n) complexity, where n is the number of points of specific subparts of the thick digital curve.
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.