Scale Preserving Smoothing of Polygons

A smoother version of a polygon ¿ is defined as a polygon which approximates ¿ according to a given criterion and which simultaneously has no more edges than ¿ itself. In this paper, a scale preserving smoothing algorithm is presented. The input to the algorithm is a polygon ¿ and the output is its smoothed version ¿. ¿, which contains all the scale information that ¿ contains, is called the linear minimum perimeter polygon (LMPP) of ¿ within a tolerance of. Using the quantity the degree of with ¿ approximates ¿ can be controlled. From the LMPP a representation for a polygon approximating ¿ can be procured, which is invariant to scale and translation changes. Examples of smoothing maps and characters have been presented.

[1]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[2]  Dennis F. Kibler,et al.  A Theory of Nonuniformly Digitized Binary Pictures , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

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

[6]  B. John Oommen,et al.  A Geometrical Approach to Polygonal Dissimilarity and Shape Matching , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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