A note on minimal length polygonal approximation to a digitized contour
Author:
Open Access
- 1 January 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (1) , 41-47
Abstract
A method for extracting a smooth polygonal contour from a digitized image is illustrated. The ordered sequence of contour points and the connection graph of the image are first obtained by a modified Ledley algorithm in one image scan. A minimal perimeter polygon subjected to specified constraints is then chosen as the approximating contour. The determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables. Some examples are presented, and the corresponding computing times are listed.Keywords
This publication has 6 references indexed in Scilit:
- Continuous Skeletons from Digitized ImagesJournal of the ACM, 1969
- On the Quantization of Line-Drawing DataIEEE Transactions on Systems Science and Cybernetics, 1969
- Sulla descrizione strutturale di immaginiCalcolo, 1968
- Sequential Operations in Digital Picture ProcessingJournal of the ACM, 1966
- High-Speed Automatic Analysis of Biomedical PicturesScience, 1964
- On the Encoding of Arbitrary Geometric ConfigurationsIEEE Transactions on Electronic Computers, 1961