Fast Polynomial Segmentation of Digitized Curves

We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the topological properties of a digitized curve into account. The algorithm uses uniform (or L) fitting and it works for segments of arbitrary thickness. We illustrate the algorithm with the segmentation of contours into straight and parabolic segments.

• Type: Conference
• Year: 2006
• Where: DGCI
• Authors: Peter Veelaert, Kristof Teelen
• Keywords: Algorithm, Constructive Polynomial Fitting, Curve Segmentation, DGCI 2006, Discrete Geometry