Fast polynomial segmentation of digitized curves

  • Authors:
  • Peter Veelaert;Kristof Teelen

  • Affiliations:
  • Member of Association University Ghent, University College Ghent, Belgium;Member of Association University Ghent, University College Ghent, Belgium

  • Venue:
  • DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.