This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scale Preserving Smoothing of Polygons
June 1983 (vol. 5 no. 6)
pp. 667-671
R. L. Kashyap, School of Electrical Engineering, Purdue University, West Lafayette, IN 47907.
B. J. Oommen, School of Computer Science, Carleton University, Ottawa, Ont., Canada K1S 5B6.
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.
Citation:
R. L. Kashyap, B. J. Oommen, "Scale Preserving Smoothing of Polygons," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 5, no. 6, pp. 667-671, June 1983, doi:10.1109/TPAMI.1983.4767460
Usage of this product signifies your acceptance of the Terms of Use.