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 条
  • [21] The DFS-heuristic for orthogonal graph drawing
    Biedl, T
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 18 (03): : 167 - 188
  • [22] An algorithm for three-dimensional orthogonal graph drawing
    Wood, DR
    GRAPH DRAWING, 1998, 1547 : 332 - 346
  • [23] Three-dimensional orthogonal graph drawing algorithms
    Eades, P
    Symvonis, A
    Whitesides, S
    DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 55 - 87
  • [24] Difference metrics for interactive orthogonal graph drawing algorithms
    Bridgeman, S
    Tamassia, R
    GRAPH DRAWING, 1998, 1547 : 57 - 71
  • [25] Placing Edge Labels by Modifying an Orthogonal Graph Drawing
    Kakoulis, Konstantinos G.
    Tollis, Ioannis G.
    GRAPH DRAWING, 2011, 6502 : 395 - 396
  • [26] A note on 3D orthogonal graph drawing
    Biedl, T
    Chan, TM
    DISCRETE APPLIED MATHEMATICS, 2005, 148 (02) : 189 - 193
  • [27] On the Hardness of Orthogonal-Order Preserving Graph Drawing
    Brandes, Ulrik
    Pampel, Barbara
    GRAPH DRAWING, 2009, 5417 : 266 - 277
  • [28] Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
    Görg, C
    Birke, P
    Pohl, M
    Diehl, S
    GRAPH DRAWING, 2004, 3383 : 228 - 238
  • [29] A fuzzy genetic algorithm for automatic orthogonal graph drawing
    Neta, Bernadete M. M.
    Araujo, Gustavo H. D.
    Guimaraes, Frederico G.
    Mesquita, Renato C.
    Ekel, Petr Ya
    APPLIED SOFT COMPUTING, 2012, 12 (04) : 1379 - 1389
  • [30] TRAVERSING A GRAPH IN GENERAL POSITION
    Klavzar, Sandi
    Krishnakumar, Aditi
    Tuite, James
    Yero, Ismael G.
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2023, 108 (03) : 353 - 365