Upward planar drawings on the standing and the rolling cylinders

被引:8
|
作者
Brandenburg, Franz J. [1 ]
机构
[1] Univ Passau, D-94030 Passau, Germany
来源
关键词
Graph drawing; Upward planar graphs; Polyline drawings; Cylinders; REPRESENTATIONS; COMPLEXITY;
D O I
10.1016/j.comgeo.2013.08.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider directed graphs with an upward planar drawing on the standing and the rolling cylinders. These graphs properly extend the upward planar graphs in the plane. The drawings allow complex curves for the edges with many zig-zags and windings around the cylinder. We show that the drawings can be simplified to polyline drawings with geodesics as straight segments, at most two bends per edge, and vertices and bends on a grid of at most cubic size. On the standing cylinder the edges do not wind and they wind at most once around the rolling cylinder, where single windings can be unavoidable. The simplifications can be computed efficiently in O(tau n(3)) time, where tau is the cost of computing the point of intersection of a curve and a horizontal line through a vertex. Moreover, we provide a complete classification of the classes of (regular) upward planar drawable graphs on the plane, the sphere, and the standing and rolling cylinders including their strict and weak variants. Strict is upward in two dimensions and weak allows horizontal lines. For upward planarity the standing and the rolling cylinders coincide in the strict case, rolling dominates standing in the regular case, and there is an incomparability in the weak case. The respective classes of graphs range properly between the upward planar and the quasi-upward planar graphs, and they have an NP-hard recognition problem. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:25 / 41
页数:17
相关论文
共 50 条
  • [11] On Upward-Planar L-Drawings of Graphs
    Angelini, Patrizio
    Chaplick, Steven
    Cornelsen, Sabine
    Da Lozzo, Giordano
    [J]. Journal of Graph Algorithms and Applications, 2024, 28 (01) : 275 - 299
  • [12] AREA REQUIREMENT AND SYMMETRY DISPLAY OF PLANAR UPWARD DRAWINGS
    DIBATTISTA, G
    TAMASSIA, R
    TOLLIS, IG
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 7 (04) : 381 - 401
  • [13] Computing Quasi-Upward Planar Drawings of Mixed GraphsaEuro
    Binucci, Carla
    Didimo, Walter
    [J]. COMPUTER JOURNAL, 2016, 59 (01): : 133 - 150
  • [14] 1-Bend Upward Planar Drawings of SP-Digraphs
    Di Giacomo, Emilio
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 2016, 9801 : 123 - 130
  • [15] Computing upward planar drawings using switch-regularity heuristics
    Didimo, W
    [J]. SOFSEM 2005:THEORY AND PRACTICE OF COMPUTER SCIENCE, 2005, 3381 : 117 - 126
  • [16] The complexity of upward drawings on spheres
    Hashemi, SM
    Rival, I
    Kisielewicz, A
    [J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1998, 14 (04): : 327 - 363
  • [17] The Complexity of Upward Drawings on Spheres
    Hashemi S.M.
    Rival I.
    Kisielewicz A.
    [J]. Order, 1997, 14 (4) : 327 - 363
  • [18] Upward drawings of search trees
    Crescenzi, P
    Penna, P
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 114 - 125
  • [19] UPWARD DRAWINGS OF ACYCLIC DIGRAPHS
    DIBATTISTA, G
    TAMASSIA, R
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 121 - 133
  • [20] UPWARD DRAWINGS OF TRICONNECTED DIGRAPHS
    BERTOLAZZI, P
    DIBATTISTA, G
    LIOTTA, G
    MANNINO, C
    [J]. ALGORITHMICA, 1994, 12 (06) : 476 - 497