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 条
  • [31] Upward drawings of trees on the minimum number of layers
    Alam, Md. Jawaherul
    Samee, Md. Abul Hassan
    Rabbi, Md. Mashfiqui
    Rahman, Md. Saidur
    [J]. WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 4921 : 88 - 99
  • [32] Path-Monotonic Upward Drawings of Graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    [J]. COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 110 - 122
  • [33] Linear area upward drawings of AVL trees
    Crescenzi, P
    Penna, P
    Piperno, A
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 9 (1-2): : 25 - 42
  • [34] Upward planar graphs and their duals
    Auer, Christopher
    Bachmaier, Christian
    Brandenburg, Franz J.
    Gleissner, Andreas
    Hanauer, Kathrin
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 571 : 36 - 49
  • [35] Classification of Planar Upward Embedding
    Auer, Christopher
    Bachmaier, Christian
    Brandenburg, Franz Josef
    Gleissner, Andreas
    [J]. GRAPH DRAWING, 2012, 7034 : 415 - 426
  • [36] Computing upward topological book embeddings of upward planar digraphs
    Giordano, F.
    Liotta, G.
    Mchedlidze, T.
    Symvonis, A.
    Whitesides, S. H.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2015, 30 : 45 - 69
  • [37] Computing upward topological book embeddings of upward planar digraphs
    Giordano, F.
    Liotta, G.
    Mchedlidze, T.
    Symvonis, A.
    [J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 172 - +
  • [38] Maximum upward planar subgraphs of embedded planar digraphs
    Binucci, Carla
    Didimo, Walter
    Giordano, Francesco
    [J]. GRAPH DRAWING, 2008, 4875 : 195 - 206
  • [39] Maximum upward planar subgraphs of embedded planar digraphs
    Binucci, Carla
    Didimo, Walter
    Giordano, Francesco
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 41 (03): : 230 - 246
  • [40] On the number of upward planar orientations of maximal planar graphs
    Frati, Fabrizio
    Gudmundsson, Joachim
    Welzl, Emo
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 544 : 32 - 59