A COUNTEREXAMPLE FOR THE SUFFICIENCY OF EDGE GUARDS IN STAR POLYGONS

被引：0
|
作者：
SUBRAMANIYAM, RV
DIWAN, AA
机构：
[1] Department of Computer Science and Engineering, Indian Institute of Technology, Powai, Bombay
来源：
INFORMATION PROCESSING LETTERS | 1991年 / 40卷 / 02期
关键词：
COMPUTATIONAL GEOMETRY; VISIBILITY; EDGE GUARDS; STAR POLYGON;
D O I：
10.1016/0020-0190(91)90016-B
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
It has been established by Toussaint that [n/5] edge guards are necessary for guarding a star polygon of n-vertices. Whether this many edge guards are always sufficient has remained an open problem. We show in this paper that [n/5] guards are not sufficient to guard a star polygon of n-vertices.
引用
收藏
页码：97 / 99
页数：3
相关论文
共 50 条
12345