Arcs and Curves in Digital PicturesArcs and Curves in Digital Pictures

Access Restriction
Subscribed

 Author Rosenfeld, Azriel Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1973 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Characterizations of digital “simple arcs” and “simple closed curves” are given. In particular, it is shown that the following are equivalent for sets $\textit{S}$ having more than four points: (1) $\textit{S}$ is a simple curve; (2) $\textit{S}$ is connected and each point of $\textit{S}$ has exactly two neighbors in $\textit{S};$ (3) $\textit{S}$ is connected, has exactly one hole, and has no deletable points. It follows that if a “shrinking” algorithm is applied to a connected $\textit{S}$ that has exactly one hole, it shrinks to a simple curve. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1973-01-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 20 Issue Number 1 Page Count 7 Starting Page 81 Ending Page 87

Open content in new tab

Source: ACM Digital Library