Piecewise linear approximation of plane curves by perimeter optimization

  • Sato Y
  • 5


    Mendeley users who have this article in their library.
  • 50


    Citations of this article.


A method for the piecewise linear approximation of a plane curve is described. An approximate curve is obtained by choosing a certain number of points from a set of sampled points of the original curve. A "point choice function" that represents the relation between the original points and the chosen points is formulated. The approximation is performed by the dynamic programming principle searching for the optimal point choice function that attains the minimal error about arc length of the curve. Evaluation of the global approximate error provides efficient curve approximations, irrespective of shape complexity, number of sampled points, and irregularity of sampling interval. © 1992.

Author-supplied keywords

  • Curve approximation
  • Dynamic programming
  • Optimal approximation
  • Perimeter length
  • Piecewise linear
  • Point choice function

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Yukio Sato

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free