An O(N) algorithm for polygonal approximation

A new, sequential algorithm for polygonal approximation of plane, closed curves is presented. It runs in O(N) time and is based on a tolerance independent of the scale factor.

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

[2]  Thomas S. Huang,et al.  Image processing , 1971 .

[3]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[4]  Azriel Rosenfeld,et al.  Picture processing: 1972 , 1972, Comput. Graph. Image Process..

[5]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

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

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

[8]  Azriel Rosenfeld.  Picture processing: 1982 , 1983, Comput. Vis. Graph. Image Process..

[9]  Theodosios Pavlidis,et al.  The Use of Algorithms of Piecewise Approximations for Picture Processing Applications , 1976, TOMS.

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