1983
Scale Preserving Smoothing of Polygons
Publication
Publication
IEEE Transactions on Pattern Analysis and Machine Intelligence , Volume PAMI-5 - Issue 6 p. 667- 671
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 e. 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. Copyright
Additional Metadata | |
---|---|
Cartography, minimum perimeter polygon, polygonal representation, scale preserving smoothing, smoothing | |
dx.doi.org/10.1109/TPAMI.1983.4767460 | |
IEEE Transactions on Pattern Analysis and Machine Intelligence | |
Organisation | School of Computer Science |
Kashyap, R.L. (R. L.), & Oommen, J. (1983). Scale Preserving Smoothing of Polygons. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-5(6), 667–671. doi:10.1109/TPAMI.1983.4767460
|