Strictly convex drawings of planar graphs

被引：0
|
作者：
Barany, Imre
Rote, Guenter
机构：
[1] Hungarian Acad Sci, Renyi Inst, H-1364 Budapest, Hungary
[2] UCL, Dept Math, London WC1E 6BT, England
[3] Free Univ Berlin, Inst Informat, D-14195 Berlin, Germany
来源：
DOCUMENTA MATHEMATICA | 2006年 / 11卷
关键词：
graph drawing; planar graphs;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Every three-connected planar graph with n vertices has a drawing on an O(n(2)) x O(n(2)) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. Tighter bounds are obtained when the faces have fewer sides. In the proof, we derive an explicit lower bound on the number of primitive vectors in a triangle.
引用
收藏
页码：369 / 391
页数：23
相关论文
共 50 条
  • [1] Strictly Convex Drawings of Planar Graphs
    Rote, Guenter
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 728 - 734
  • [2] STRICTLY CONVEX DRAWINGS OF 3-CONNECTED PLANAR GRAPHS
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2024, 15 (01) : 1 - 20
  • [3] Strictly-Convex Drawings of 3-Connected Planar Graphs
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022, 2023, 13764 : 144 - 156
  • [4] Convex drawings of hierarchical planar graphs and clustered planar graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (03) : 282 - 295
  • [5] Convex grid drawings of 3-connected planar graphs
    Chrobak, M
    Kant, G
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (03) : 211 - 223
  • [6] Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes
    Stefan Felsner
    Order, 2001, 18 : 19 - 37
  • [7] Convex drawings of planar graphs and the order dimension of 3-polytopes
    Felsner, S
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2001, 18 (01): : 19 - 37
  • [8] No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
    Hasan, Md Manzurul
    Rahman, Md Saidur
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 254 - 265
  • [9] Convex grid drawings of planar graphs with constant edge-vertex resolution
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    THEORETICAL COMPUTER SCIENCE, 2024, 982
  • [10] Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 157 - 171
12345