Optimal piecewise linear approximation of digitized curves

In this paper, a new piecewise linear method is presented for the approximation of digitized curves. This method produces a sequence of consecutive line segments and has the following characteristics (i) it approximates the digitized curve with the minimum number of line segments, (ii) the Euclidean distance between each point of the digitized curve and the line segment that approximates it, does not exceed a boundary value epsilon and (iii) the vertices of the produced line are not (necessarily) points of the input curve.