论文标题
数字拓扑中的凸度和冻结集
Convexity and Freezing Sets in Digital Topology
论文作者
论文摘要
我们继续研究[2]中引入的数字拓扑结构。我们展示了如何在数字平面z^2中找到“厚”凸X X的最小冻结集。我们举例说明了x是凸的假设的重要性。
We continue the study of freezing sets in digital topology, introduced in [2]. We show how to find a minimal freezing set for a "thick" convex disk X in the digital plane Z^2. We give examples showing the significance of the assumption that X is convex.
