Segmentation of planar curves into circular arcs and line segments

https://doi.org/10.1016/0262-8856(95)01042-4Get rights and content

Abstract

In many applications, like shape analysis, it is necessary to decompose an object contour into straight-line segments and circular arcs, because many man-made objects (especially machined parts) are composed of these two types of geometric entities. This paper presents a procedure for segmenting a planar curve into lines and arcs, in which the number of entities (or break points) of the curve is given. This procedure can be divided into two stages: (1) to obtain a starting set of break points, and determine the approximation functions (lines and arcs) for the data intervals that are separated by the break points; and (2) to adjust the break points until the error norm is locally minimized. The first stage is based on the detection of significant changes in curvature using the chain-code and differential chain-code techniques, and the second stage is an optimization curve/line fitting scheme. A computational comparison with a modified dynamic programming (MDP) approach shows that the proposed procedure obtains near optimal solutions (relative errors less than 1%) for all the test problems, and requires less than 1.2% of the computational time needed by the MDP approach.

References (24)

  • F.T. Farago
  • T. Pavlidis et al.

    Segmentation of plane curves

    IEEE Trans. Comput.

    (1974)
  • Cited by (23)

    • Angles of arc-polygons and Lombardi drawings of cacti

      2023, Computational Geometry: Theory and Applications
    • A robust and accurate breakpoint detection method for line-structured laser scanner

      2019, Optics and Laser Technology
      Citation Excerpt :

      The third step is a series of suppression and removing process to obtain the dominant points. Chen et al. [8] presented a curve segmentation procedure, which includes two steps. The first step is determining a starting set of breakpoints based on the freeman code.

    • Segmentation and multi-model approximation of digital curves

      2012, Pattern Recognition Letters
      Citation Excerpt :

      This can be undertaken with a heuristic algorithms (Chen et al., 1996), with a DP algorithm (Tortorella et al., 2008), or with Lagrange Multiplier method with user-defined value of the Lagrange multiplier (Bodansky and Gribov, 2006). In (Chen et al., 1996; Horng and Li, 2001; Sarkar et al., 2003; Tortorella et al., 2008), the total number of approximation segments is given and the task there is to find the best location of breakpoints. Such an approach is probably justifiable in those cases where we have prior knowledge about the shape structure and where the main problem is to find the location of the breakpoints and the type of approximating models for the curve segments.

    View all citing articles on Scopus
    View full text