Optimum Uniform Piecewise Linear Approximation of Planar Curves

Two-dimensional digital curves are often uniformly approximated by polygons or piecewise linear curves. Several algorithms have been proposed in the literature to find such curves. We present an algorithm that finds a piecewise linear curve with the minimal number of segments required to approximate a curve within a uniform error with fixed initial and final points. We compare our optimal algorithm to several suboptimal algorithms with respect to the number of linear segments required in the approximation and the execution time of the algorithm.

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

[2]  Ivan Tomek,et al.  Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable , 1974, IEEE Transactions on Computers.

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

[4]  Theodosios Pavlidis,et al.  Waveform Segmentation Through Functional Approximation , 1973, IEEE Transactions on Computers.

[5]  Joos Vandewalle,et al.  On the Calculation of the Piecewise Linear Approximation to a Discrete Function , 1975, IEEE Transactions on Computers.

[6]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[7]  C. Lawson.  Characteristic properties of the segmented rational minmax approximation problem , 1964 .

[8]  Brian Gluss.  A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information , 1962, Inf. Control..

[9]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[10]  Brian Gluss,et al.  Further remarks on line segment curve-fitting using dynamic programming , 1962, Commun. ACM.

[11]  R BELLMAN,et al.  ON THE IDENTIFICATION OF SYSTEMS AND THE UNSCRAMBLING OF DATA: SOME PROBLEMS SUGGESTED BY NEUROPHYSIOLOGY. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[13]  M. Cox.  Curve Fitting with Piecewise Polynomials , 1971 .

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

[15]  Brian Gluss.  An Alternative Method for Continuous Line Segment Curve-Fitting , 1964, Inf. Control..

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

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

[18]  R. Bellman.  Dynamic programming. , 1957, Science.

[19]  Jack Sklansky,et al.  Minimum-Perimeter Polygons of Digitized Silhouettes , 1972, IEEE Transactions on Computers.

[20]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Computer Graphics and Image Processing.

[21]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[24]  Brian Gluss.  Least squares fitting of planes to surfaces using dynamic programming , 1963, CACM.

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