Affiliation:
1. University of Maryland, Computer Science Center, College Park, Maryland
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 four points: (1)
S
is a simple curve; (2)
S
is connected and each point of
S
has exactly two neighbors in
S
; (3)
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
107 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献