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 条
  • [41] Characterizing and Recognizing 4-Map Graphs
    Franz J. Brandenburg
    Algorithmica, 2019, 81 : 1818 - 1843
  • [42] CHARACTERIZING AND RECOGNIZING THE VISIBILITY GRAPH OF A FUNNEL-SHAPED POLYGON
    CHOI, SH
    SHIN, SY
    CHWA, KY
    ALGORITHMICA, 1995, 14 (01) : 27 - 51
  • [43] VISIBILITY GRAPHS OF STAIRCASE POLYGONS AND THE WEAK BRUHAT ORDER .1. FROM VISIBILITY GRAPHS TO MAXIMAL-CHAINS
    ABELLO, J
    EGECIOGLU, O
    KUMAR, K
    DISCRETE & COMPUTATIONAL GEOMETRY, 1995, 14 (03) : 331 - 358
  • [44] Reconstructing Visibility Graphs with Simple Robots
    Bilo, Davide
    Disser, Yann
    Mihalak, Matus
    Suri, Subhash
    Vicari, Elias
    Widmayer, Peter
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, 2010, 5869 : 87 - +
  • [45] Reconstructing visibility graphs with simple robots
    Bilo, D.
    Disser, Y.
    Mihalak, M.
    Suri, S.
    Vicari, E.
    Widmayer, P.
    THEORETICAL COMPUTER SCIENCE, 2012, 444 : 52 - 59
  • [46] The σ-visibility of polygons
    Qin, ZP
    Zhang, HG
    FIFTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN & COMPUTER GRAPHICS, VOLS 1 AND 2, 1997, : 297 - 302
  • [47] Characterizing and recognizing exact-distance squares of graphs
    Bai, Yandong
    Cortes, Pedro P.
    Naserasr, Reza
    Quiroz, Daniel A.
    DISCRETE MATHEMATICS, 2024, 347 (08)
  • [48] Characterizing Link-2 LR-Visibility Polygons and Related Problems
    Tan, Xuehou
    Jiang, Bo
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (02) : 423 - 429
  • [49] Query-point visibility constrained shortest paths in simple polygons
    Khosravi, Ramtin
    Ghodsi, Mohammad
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 1 - 11
  • [50] Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
    Nilsson, Bengt J.
    Orden, David
    Palios, Leonidas
    Seara, Carlos
    Zylinski, Pawel
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 311 - 323
12345