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 条
  • [1] Edge guards in rectilinear polygons
    Bjorling-Sachs, I
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 11 (02): : 111 - 123
  • [2] Edge guards in straight walkable polygons
    Tan, XH
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1999, 9 (01) : 63 - 79
  • [3] Locating Guards for Visibility Coverage of Polygons
    Amit, Yoav
    Mitchell, Joseph S. B.
    Packer, Eli
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 120 - 134
  • [4] Vertex Guards in a Subclass of Orthogonal Polygons
    Martins, Ana Mafalda
    Bajuelos, Antonio Leslie
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (9A): : 102 - 108
  • [5] Sweeping simple polygons with a chain of guards
    Efrat, A
    Guibas, LJ
    Har-Peled, S
    Lin, DC
    Mitchell, JSB
    Murali, TM
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 927 - 936
  • [6] Placing guards inside orthogonal polygons
    Gewali, LP
    INFORMATION SCIENCES, 1996, 88 (1-4) : 1 - 14
  • [7] LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
    Amit, Yoav
    Mitchell, Joseph S. B.
    Packer, Eli
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2010, 20 (05) : 601 - 630
  • [8] A COUNTEREXAMPLE TO A DIAMETER ALGORITHM FOR CONVEX POLYGONS
    BHATTACHARYA, BK
    TOUSSAINT, GT
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1982, 4 (03) : 306 - 309
  • [9] A COUNTEREXAMPLE TO A CONVEX-HULL ALGORITHM FOR POLYGONS
    TOUSSAINT, G
    PATTERN RECOGNITION, 1991, 24 (02) : 183 - 184
  • [10] Optimum sweeps of simple polygons with two guards
    Tan, Xuehou
    Jiang, Bo
    INFORMATION PROCESSING LETTERS, 2014, 114 (03) : 130 - 136
12345