Optimal polygonal approximation of digital curves

Abstract An algorithm for optimal polygonal approximation is presented. Given a value for the maximal allowed distance between the approximation and the curve, the algorithm finds an approximation with the minimal number of vertices. The city-block metric is used to measure the distance between the approximation and the curve. The algorithm worst case complexity is O( n 2 ), where n is the number of points in the curve. An efficient and optimal solution for the case of closed curves where no initial point is given, is also presented.

[1]  BIMAL KUMAR RAY,et al.  Determination of optimal polygon from digital curve using L1 norm , 1993, Pattern Recognit..

[2]  Yazid M. Sharaiha,et al.  An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs , 1993, CVGIP Graph. Model. Image Process..

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

[4]  Roland T. Chin,et al.  Scale-Based Detection of Corners of Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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

[8]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

[9]  Theodosios Pavlidis,et al.  Polygonal Approximations by Newton's Method , 1977, IEEE Transactions on Computers.

[10]  Frank Rhodes.  Some characterizations of the chessboard metric and the city block metric , 1990, Pattern Recognit. Lett..

[11]  Yukio Sato,et al.  Piecewise linear approximation of plane curves by perimeter optimization , 1992, Pattern Recognit..

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

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

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

[15]  Inge Jonassen,et al.  A comparison of splitting methods for the identification of corner-points , 1991, Pattern Recognit. Lett..

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

[17]  Hiroshi Imai,et al.  Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..

[18]  Shimon Even,et al.  Graph Algorithms , 1979 .

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

[20]  Michael Brady,et al.  The Curvature Primal Sketch , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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