Approximation of digital curves with line segments and circular arcs using genetic algorithms

Usability assessment of selected methods of optimization for some measurement task in coordinate measurement technique

“…However, especially when analyzing data acquired during measurements of free-form surfaces, collected points are also approximated with more simple models, i.e. with sequences of circular arcs joined together with suitable continuity conditions, called piecewise circular splines [20][21][22][23]. Such models are not so flexible in description of curves like NURBS [24], but due to simpler models they are suitable for programming and application in measurement devices.…”

Multiprimitive segmentation based on meaningful breakpoints for fitting digital planar curves with line segments and conic arcs

“…Hence, curve segmentation using line segments and circular arcs is selected, and it is a better representation than polygonal approximation. Thus, many methods were proposed to obtain line segments and circular arcs [11][12][13][14]. The main reason is that a circular arc is easily obtained based on three parameters (center (x 0 ,y 0 ) and radius r).…”

Corner detection and curve segmentation by multiresolution chain-code linking

“…A taxonomy of 2D curve characterisation methods could start by classifying them into two large groups: curve fitting [1][2][3][4][5][6][7][8] and curvature-based algorithms [9][10][11][12][13][14][15][16][17][18]. Literature offers many methods for fitting digital curves, polygonal approximations [1][2][3][4] are the simplest ones: they search for the polygon with the minimum number of sides that best fits the curve, for a given error criterion.…”

“…Nevertheless, curved portions are better approximated with higher-order curve-pieces: Pei and Horng [6] perform a generalisation of Perez and Vidal's method [2] to the case of circular arcs. Sarkar et al [7] fit a digital curve with line segments and circular arcs using genetic algorithms. Rosin and West [8] propose an algorithm for segmenting connected points into a combination of representations such as lines, circular, elliptical and superelliptical arcs, and polynomials.…”