Abstract
An automatic and efficient algorithm based on the dynamic programming approach for constructing optimal polygonal approximation of digital curves is proposed. The number of polygonal vertices is determined automatically by a termination mechanism. Three techniques are used to improve the efficiency of computation. Our algorithm is applied to the widely adopted test patterns provided by Teh and Chin and to the shapes extracted from a real image. Excellent results confirm the applicability of the proposed algorithm.
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.
