Accession Number : AD0690198

Title :   ON LIMIT PROPERTIES IN DIGITIZATION SCHEMES.

Descriptive Note : Technical rept.,

Corporate Author : MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER

Personal Author(s) : Montanari,G. Ugo

Report Date : JUN 1969

Pagination or Media Count : 41

Abstract : Continuity of curve digitizations is considered, and it is pointed out that no proposed digitization scheme satisfies continuity requirements. A general definition of digitization scheme is given, having those in the literature as special cases, and it is proved that for practical purposes, no digitization scheme is possible, in which limit curves always have unambiguous digitizations. A weaker definition of continuity is then given, and this property is proved to hold for a large class of digitization schemes. These concepts apply when a curve with some extremal property must be reconstructed from the digitization. The cases of a least perimeter polygon and of a least energy rod are considered in detail. In the first case, necessary and sufficient conditions are developed that assure a one-to-one correspondence between the given digitization and the minimal polygon. The convergence of an algorithm for finding the minimal polygon, is proved in the convex case. (Author)

Descriptors :   (*PATTERN RECOGNITION, DIFFERENTIAL GEOMETRY), (*COMPUTER PROGRAMMING, CURVED PROFILES), NONLINEAR PROGRAMMING, CONVEX SETS, CURVE FITTING, ALGORITHMS, THEOREMS

Subject Categories : Theoretical Mathematics
      Computer Programming and Software
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE