A Note on Minimal Length Polygonal Approximation to a Digitized Contour

Communications of the ACM

Volumn 13, Issue 1, 1970, Pages 41-47

  Montanari, U ^a  

^a CNR   (Italy)

Author keywords

connection tree; digitized image; minimal polygon; nonlinear programming; optimal approximation

Indexed keywords

EID: 84976738812     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/361953.361967     Document Type: Article

References (8)

1. Ledley, R. S. High-speed automatic analysis of biomedical pictures. Science 143 (1964), 219-233.
2. Freeman, H. On the encoding of arbitrary geometric configurations. IRE Trans. EC-10, 2 (1961), 260-268.
3. Freeman, H., and Glass, J. M. On the quantization of line-drawing data. IEEE Trans SSC-B, 1 (1969), 70-79.
4. Rosenfeld, A., and Pfalz, J. L. Sequential operations in digital picture processing. J. ACM 13, 4 (1966), 471-494.
5. Montanari, U. Sulla descrizione strutturale di immagini. Proc. Congresso AICA 1968, Napoli, Italy, Sept. 26-29, 1968.
6. Montanari, U. Continuous skeletons from digitized images. J. ACM. 16, 4 (Oct. 1969) 534-549.
7. Rosenfeld, A. Figure extraction. In Automatic Interpretation and Classification of Images, A. Grasselli (Ed.), Academic Press, New York (in press).
8. Saaty, T. L., and Bram, J. Nonlinear Mathematics. McGraw-Hill, New York, 1964.