An algorithm for polygonal approximation based on iterative point elimination

A simple and fast algorithm for polygonal approximation of digital curves is proposed. The algorithm is based on a greedy iterative elimination of a point with the currently minimal error value. The error criterion is defined such that the elimination of a curve point requires the update of the error associated only with its two neighbors. The use of a heap data-structure yields a worst case complexity of O(n log n). The algorithm is independent of the starting point.

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

[2]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[3]  F. Attneave.  Some informational aspects of visual perception. , 1954, Psychological review.

[4]  Jia-Guu Leu,et al.  Polygonal approximation of 2-D shapes through boundary merging , 1988, Pattern Recognit. Lett..

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

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

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

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

[10]  Laurence Boxer,et al.  Polygonal approximation by boundary reduction , 1993, Pattern Recognit. Lett..

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

[12]  Jin-Jang Leou,et al.  New polygonal approximation schemes for object shape representation , 1993, Pattern Recognit..

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

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

[15]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

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

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