On the number of visibility graphs of simple polygons

被引：0
|
作者：
Hurtado, F [1 ]
Noy, M [1 ]
机构：
[1] Univ Politecn Catalunya, Dept Matemat Aplicada 2, E-08028 Barcelona, Spain
来源：
DISCRETE MATHEMATICS | 2001年 / 232卷 / 1-3期
关键词：
visibility graph; order type; asymptotic enumeration;
D O I：
10.1016/S0012-365X(00)00353-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present upper and lower bounds for the number of labelled visibility graphs of simple polygons of n vertices. The lower bound is roughly in the order of O(n(2n)) and the upper bound is O(n(3n)). (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：139 / 143
页数：5
相关论文
共 50 条
  • [41] Maximal number of edges in geometric graphs without convex polygons
    Nara, C
    Sakai, T
    Urrutia, J
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2002, 2866 : 215 - 220
  • [42] Sweeping simple polygons with the minimum number of chain guards
    Tan, Xuehou
    INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 66 - 71
  • [43] Bar κ-visibility graphs:: Bounds on the number of edges, chromatic number, and thickness
    Dean, AM
    Evans, W
    Gethner, E
    Laison, JD
    Safari, MA
    Trotter, WT
    GRAPH DRAWING, 2006, 3843 : 73 - 82
  • [44] Lower (total) mutual-visibility number in graphs
    Bresar, Bostjan
    Yero, Ismael G.
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 465
  • [45] Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
    Zarrabi, Mohammad Reza
    Charkari, Nasrollah Moghaddam
    IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2022, 17 (02): : 235 - 241
  • [46] Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
    Zarrabi, Mohammad Reza
    Charkari, Nasrollah Moghaddam
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 301 - 319
  • [47] Linear time algorithms for visibility and shortest path problems inside simple polygons
    Guibas, Leo
    Hershberger, John
    Leven, Daniel
    Sharir, Micha
    Tarjan, Robert E.
    Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986, 1986, : 1 - 13
  • [48] Barrier Resilience of Visibility Polygons
    Gilbers, Alexander
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2015, 39 (03): : 221 - 227
  • [49] LR-visibility in polygons
    Das, G
    Heffernan, PJ
    Narasimhan, G
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (1-2): : 37 - 57
  • [50] An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons
    Ackerman, Eyal
    Keszegh, Balazs
    Rote, Guenter
    DISCRETE & COMPUTATIONAL GEOMETRY, 2022, 68 (04) : 1049 - 1077
12345