Arcs and Curves in Digital Pictures
Arcs and Curves in Digital Pictures
复制标题
DOI：
10.1145/321738.321745
复制
发表时间：
1973
期刊：
影响因子：
--
通讯作者：
A. Rosenfeld
中科院分区：
文献类型：
--
作者：
A. Rosenfeld
给出了数字“简单圆弧”和“简单闭曲线”的特征。特别地，证明了对于具有多于四个点的集合S，以下是等价的：（1）S是简单曲线;（2）S是连通的，并且S的每个点在S中恰好有两个邻居;（3）S是连通的，恰好有一个洞，并且没有可删除的点。因此，如果将“收缩”算法应用于具有恰好一个孔的连通S，则它收缩为简单曲线。
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.