Optimal algorithm for progressive polygon approximation of discrete planar curves
Prabhudev I. Hosur, Kai‐Kuang Ma · 2003
The problem of optimal polygon approximation of a discrete planar curve is addressed in this paper. Towards this end, an optimal algorithm using the progressive polygon approximation approach is proposed for a given acceptable approximation error and initial vertex. The proposed algorithm is optimal because it determines the minimal number of edges for a given approximation error tolerance. The proposed scheme can be extended to the approximation of digital contours wherein the contour points and the polygon vertices are restricted to the integer plane Z/sup 2/.