Polygonal approximation of closed discrete curves

  • Kolesnikov A
  • Fränti P
  • 33


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


    Citations of this article.


Optimal polygonal approximation of closed curves differs from the case of open curve in the sense that the location of the starting point must also be determined. Straightforward exhaustive search would take N times more time than the corresponding optimal algorithm for an open curve, because there are N possible points to be considered as the starting point. Faster sub-optimal solution can be found by iterating the search and heuristically selecting different starting point at each iteration. In this paper, we propose to find the optimal approximation of a cyclically extended closed curve of double size, and to select the best possible starting point by search in the extended search space for the curve. The proposed approach provides solution very close to the optimal one using at most twice as much time as required by the optimal algorithm for the corresponding open curve. © 2006 Pattern Recognition Society.

Author-supplied keywords

  • Closed contour
  • Dynamic programming
  • Polygonal approximation

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


  • Alexander Kolesnikov

  • Pasi Fränti

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free