Bend-optimal orthogonal graph drawing in the general position model

被引:4
|
作者
Felsner, Stefan [1 ]
Kaufmann, Michael [2 ]
Valtr, Pavel [3 ,4 ]
机构
[1] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany
[2] Univ Tubingen, Wilhelm Schickard Inst Informat, D-72076 Tubingen, Germany
[3] Charles Univ Prague, Dept Appl Math, CR-11800 Prague 1, Czech Republic
[4] Charles Univ Prague, Inst Theoret Comp Sci CE ITI, CR-11800 Prague 1, Czech Republic
来源
关键词
Orthogonal graph drawing; Eulerian orientations; Discrete harmonic functions;
D O I
10.1016/j.comgeo.2013.03.002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider orthogonal drawings in the general position model, i.e., no two points share a coordinate. The drawings are also required to be bend minimal, i.e., each edge of a drawing in k dimensions has exactly one segment parallel to each coordinate direction that are glued together at k 1 bends. We provide a precise description of the class of graphs that admit an orthogonal drawing in the general position model in the plane. The main tools for the proof are Eulerian orientations of graphs and discrete harmonic functions. The tools developed for the planar case can also be applied in higher dimensions. We discuss two-bend drawings in three dimensions and show that K2k+2 admits a k-bend drawing in k + 1 dimensions. If we allow that a vertex is placed at infinity, we can draw K2k+3 with k bends in k + 1 dimensions. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:460 / 468
页数:9
相关论文
共 50 条
  • [1] Optimal three-dimensional orthogonal graph drawing in the general position model
    Wood, DR
    THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 151 - 178
  • [2] Optimal Orthogonal Graph Drawing with Convex Bend Costs
    Blaesius, Thomas
    Rutter, Ignaz
    Wagner, Dorothea
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 184 - 195
  • [3] Optimal Orthogonal Graph Drawing with Convex Bend Costs
    Blasius, Thomas
    Rutter, Ignaz
    Wagner, Dorothea
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (03)
  • [4] Bend-optimal orthogonal drawings of triconnected plane graphs
    Bhatia, Siddharth
    Lad, Kunal
    Kumar, Rajiv
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2018, 15 (02) : 168 - 173
  • [5] A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
    Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, Sendai
    980-8579, Japan
    Journal of Graph Algorithms and Applications, 1999, 3 (04): : 31 - 62
  • [6] Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
    Therese Biedl
    Torsten Thiele
    David R. Wood
    Algorithmica, 2006, 44 : 233 - 255
  • [7] Three-dimensional orthogonal graph drawing with optimal volume
    Biedl, T
    Thiele, T
    Wood, DR
    ALGORITHMICA, 2006, 44 (03) : 233 - 255
  • [8] Colorability in orthogonal graph drawing
    Stola, Jan
    GRAPH DRAWING, 2008, 4875 : 327 - 338
  • [9] Issues in orthogonal graph drawing
    Papakostas, A
    Tollis, IG
    GRAPH DRAWING, 1996, 1027 : 419 - 430
  • [10] Interactive orthogonal graph drawing
    Papakostas, A
    Tollis, IG
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (11) : 1297 - 1309