Minimum-Perimeter Polygons of Digitized Silhouettes
- 1 March 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (3), 260-268
- https://doi.org/10.1109/tc.1972.5008948
Abstract
The minimum-perimeter polygon of a silhouette has been shown to be a means for recognizing convex silhouettes and for smoothing the effects of digitization in silhouettes. We describe a new method of computing the minimum-perimeter polygon (MPP) of any digitized silhouette satisfying certain constraints of connectedness and smoothness, and establish the underlying theory. Such a digitized silhouette is called a ``regular complex,'' in accordance with the usage in piecewise linear topology. The method makes use of the concept of a stretched string constrained to lie in the cellular boundary of the digitized silhouette. We show that, by properly marking the virtual as well as the real vertices of an MPP, the MPP can serve as a precise representation of any regular complex, and that this representation is often an economical one.Keywords
This publication has 7 references indexed in Scilit:
- On Limit Properties in Digitization SchemesJournal of the ACM, 1970
- Recognition of convex blobsPattern Recognition, 1970
- Connectivity in Digital PicturesJournal of the ACM, 1970
- A note on minimal length polygonal approximation to a digitized contourCommunications of the ACM, 1970
- Languages of encoded line patternsInformation and Control, 1968
- Computer representation of planar regions by their skeletonsCommunications of the ACM, 1967
- On the Encoding of Arbitrary Geometric ConfigurationsIEEE Transactions on Electronic Computers, 1961