Scale Preserving Smoothing of Polygons
- 1 November 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. PAMI-5 (6) , 667-671
- https://doi.org/10.1109/tpami.1983.4767460
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- A Geometrical Approach to Polygonal Dissimilarity and Shape MatchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Structural Pattern RecognitionPublished by Springer Nature ,1977
- A Theory of Nonuniformly Digitized Binary PicturesIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An iterative procedure for the polygonal approximation of plane curvesComputer Graphics and Image Processing, 1972
- Minimum-Perimeter Polygons of Digitized SilhouettesIEEE Transactions on Computers, 1972
- A note on minimal length polygonal approximation to a digitized contourCommunications of the ACM, 1970
- On the Encoding of Arbitrary Geometric ConfigurationsIEEE Transactions on Electronic Computers, 1961