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 条
  • [31] 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
  • [32] 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 - +
  • [33] 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
  • [34] The σ-visibility of polygons
    Qin, ZP
    Zhang, HG
    FIFTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN & COMPUTER GRAPHICS, VOLS 1 AND 2, 1997, : 297 - 302
  • [35] ON THE BAR VISIBILITY NUMBER OF COMPLETE BIPARTITE GRAPHS
    Cao, Weiting
    West, Douglas B.
    Yang, Yan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (03) : 2234 - 2248
  • [36] Query-point visibility constrained shortest paths in simple polygons
    Khosravi, Ramtin
    Ghodsi, Mohammad
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 1 - 11
  • [37] 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
  • [38] Weak visibility queries of line segments in simple polygons and polygonal domains
    Bygi, M. Nouri
    Ghodsi, M.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2018, 95 (04) : 721 - 738
  • [39] PARALLEL METHODS FOR VISIBILITY AND SHORTEST-PATH PROBLEMS IN SIMPLE POLYGONS
    GOODRICH, MT
    SHAUCK, SB
    GUHA, S
    ALGORITHMICA, 1992, 8 (5-6) : 461 - 486
  • [40] Visibility of Disjoint Polygons
    Asano, Takao
    Asano, Tetsuo
    Guibas, Leonidas
    Hershberger, John
    Imai, Hiroshi
    ALGORITHMICA, 1986, 1 (1-4) : 49 - 63
12345