An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves

A new algorithm is presented for the piecewise linear approximation of two-dimensional digitized curves against a square grid. The algorithm utilizes an adaptive reduction procedure in two approximation phases to select the critical points of a digitized curve such that the deviation, from the digitized curve to its final approximated curve, is bounded by a uniform error tolerance. The time complexity of this algorithm is O(m/sup 2/) rather than O(n/sup 2/) on the theoretical plane. In the experiments of fixing the initial and the final processing points, the performance of the algorithm has been compared to those of three prominent other algorithms regarding the required number of critical points and the total execution time of the program. Of the four algorithms compared, the present algorithm consistently has the shortest execution time of the program, and it tends most to require as few critical points as the optimum algorithm that was tested. >

[1]  Theo Pavlidis,et al.  Algorithms for Graphics and Imag , 1983 .

[2]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[3]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[4]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[5]  Charles M. Williams,et al.  An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

[6]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[7]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[9]  F. Badi'i,et al.  Functional approximation of planar curves via adaptive segmentation , 1982 .

[10]  James Robergé.  A data reduction algorithm for planar curves , 1985, Comput. Vis. Graph. Image Process..

[11]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..

[12]  Theodosios Pavlidis,et al.  Algorithms for Shape Analysis of Contours and Waveforms , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.