Abstract
A method for error‐bounded approximation of digital curves with line segments and circular arcs is proposed. In the proposed method, a chromosome is used to represent an approximation by a string, and the operations of genetic algorithms are designed especially to obtain the approximation for which an error is bounded by a given norm. Many experiments show that the convergence is guaranteed, and optimal or near‐optimal solutions can be obtained. The proposed method successfully reduced the total number of line segments and circular arcs required to approximate the digital curves under the error‐bound criterion.
Sign-in/Register to access full text options 
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.
