On recognizing and characterizing visibility graphs of simple polygons

被引：0
|
作者：
S. K. Ghosh
机构：
[1] Tata Institute of Fundamental Research,Computer Science Group
来源：
Discrete & Computational Geometry | 1997年 / 17卷
关键词：
Hamiltonian Cycle; Chordal Graph; Simple Polygon; Visibility Graph; Perfect Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we establish four necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We present an 0(n2)-time algorithm for testing the first and second necessary conditions and leave it open whether the third and fourth necessary conditions can be tested in polynomial time. We also show that visibility graphs of simple polygons do not possess the characteristics of a few special classes of graphs
引用
收藏
页码：143 / 162
页数：19
相关论文
共 50 条
  • [11] Visibility Graphs of Anchor Polygons
    Boomari H.
    Zarei A.
    Journal of Graph Algorithms and Applications, 2022, 26 (01) : 15 - 34
  • [12] Recognizing Weakly Simple Polygons
    Akitaya, Hugo A.
    Aloupis, Greg
    Erickson, Jeff
    Toth, Csaba D.
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 58 (04) : 785 - 821
  • [13] Recognizing Weakly Simple Polygons
    Hugo A. Akitaya
    Greg Aloupis
    Jeff Erickson
    Csaba D. Tóth
    Discrete & Computational Geometry, 2017, 58 : 785 - 821
  • [14] Efficient visibility queries in simple polygons
    Bose, P
    Lubiw, A
    Munro, JI
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 23 (03): : 313 - 335
  • [15] Visibility queries and maintenance in simple polygons
    Aronov, B
    Guibas, LJ
    Teichmann, M
    Zhang, L
    DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 27 (04) : 461 - 483
  • [16] Visibility queries in simple polygons and applications
    Aronov, B
    Guibas, LJ
    Teichmann, M
    Zhang, L
    ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 357 - 366
  • [17] ON CHARACTERIZING TERRAIN VISIBILITY GRAPHS
    Evans, William
    Saeedi, Noushin
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2015, 6 (01) : 108 - 141
  • [18] Weak visibility counting in simple polygons
    Bygi, Mojtaba Nouri
    Daneshpajouh, Shervin
    Alipour, Sharareh
    Ghodsi, Mohammad
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 288 : 215 - 222
  • [19] Visibility Queries and Maintenance in Simple Polygons
    Discrete & Computational Geometry, 2002, 27 : 461 - 483
  • [20] New Results on Visibility in Simple Polygons
    Gilbers, Alexander
    Klein, Rolf
    ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 327 - 338
12345