Arcs and Curves in Digital Pictures.
Abstract
Characterizations of digital simple arcs and simple closed curves are given. In particular, it is shown that the following are equivalent for sets S having more than 4 points: S is a simple curve; S is connected and each point of S has exactly two neighbors in S; S is connected, has exactly one hole, and has no deletable points. It follows that if a shrinking algorithm is applied to a connected S that has exactly one hole, it shrinks to a simple curve. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1971
- Accession Number
- AD0740145
Entities
People
- Azriel Rosenfeld
Organizations
- University of Maryland