Polygonal approximation of closed contours

Abstract

Optimal 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 algorithm for open curve. We propose to approximate a cyclically extended contour of double size, and to select the best possible starting point by analyzing the state space. This takes only twice of the time required by the algorithm for open curve. © Springer-Verlag 2003.