Abstract
Given a digital planar curve of N ordered points, the dynamic programming algorithm is applied to find M dominant points, among the N points, which construct a globally optimal approximation to the given curve provided that a circular arc is properly designed between each pair of adjacent dominant points. This curve-fitting method is generalized to approximate closed curves. A fast algorithm for efficient computation is also introduced. The performance is shown by some experimental results.
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.
