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 条
  • [21] A Characterization of Visibility Graphs for Pseudo-polygons
    Gibson, Matt
    Krohn, Erik
    Wang, Qing
    ALGORITHMS - ESA 2015, 2015, 9294 : 607 - 618
  • [22] Orthogonal edge visibility graphs of polygons with holes
    Srinivasaraghavan, G
    Mukhopadhyay, A
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2000, 10 (01) : 79 - 102
  • [23] Weak visibility polygons of NURBS curves inside simple polygons
    Yang, Cheng-Lei
    Wang, Wei-Zhen
    Yang, Yi-Jun
    Lu, Lin
    Zhu, Zhi-Jie
    Zhu, Binhai
    Zeng, Wei
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2014, 256 : 1 - 15
  • [24] Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
    Agrawal, Sanjana
    Inkulu, R.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 3056 - 3082
  • [25] Characterizing LR-visibility polygons and related problems
    Bhattacharya, BK
    Ghosh, SK
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 18 (01): : 19 - 36
  • [26] Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
    Sanjana Agrawal
    R. Inkulu
    Journal of Combinatorial Optimization, 2022, 44 : 3056 - 3082
  • [27] A sufficient condition for visibility paths in simple polygons
    Zarrabi, Mohammad Reza
    Charkari, Nasrollah Moghaddam
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2023, 8 (02) : 93 - 98
  • [28] Simple Characterization of LR-visibility Polygons
    Tan, Xuehou
    Zhang, Jing
    Jiang, Bo
    COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 2011, 7033 : 176 - 187
  • [29] Characterizing and Recognizing Probe Block Graphs
    Peng, S.-L. (slpeng@mail.ndhu.edu.tw), 2013, Springer Science and Business Media Deutschland GmbH (20):
  • [30] Characterizing and recognizing probe block graphs
    Le, Van Bang
    Peng, Sheng-Lung
    THEORETICAL COMPUTER SCIENCE, 2015, 568 : 97 - 102
12345