A method for approximation of digital planar curves with line segments and circular arcs using genetic algorithms is proposed.

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 ...

A method for approximation of digital planar curves with line segments and circular arcs using genetic algorithms is proposed.

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 ...

Approximation of digital curves with line segments and circular arcs using genetic algorithms - Free download as PDF File (.pdf), Text File (.txt) or read ...

B. Sarkar, L. K. Singh, D. Sarkar, “Approximation of Digital Curves with Line Segments and Circular Arcs using Genetic Algorithms”, Pattern Recognition Letters, ...

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 ...

The approximation is composed of 2 line-segments and 6 circular arcs. The corresponding breakpoints are respectively C3, C5, C20, C29, C35, C37, C41, and C44.

Jun 18, 2011 · Abstract. In this paper, a polygonal approximation approach based on a multi- objective genetic algorithm is proposed.

This paper presents a dynamic programming algorithm to detect dominant points within a planar digital curve by approximating the given curve with quadric ...