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 条
  • [31] Fully dynamic 3-dimensional orthogonal graph drawing
    Closson, M
    Gartshore, S
    Johansen, J
    Wismath, SK
    GRAPH DRAWING, 1999, 1731 : 49 - 58
  • [32] Complexity results for three-dimensional orthogonal graph drawing
    Patrignani, Maurizio
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (01) : 140 - 161
  • [33] Complexity results for three-dimensional orthogonal graph drawing
    Patrignani, M
    GRAPH DRAWING, 2006, 3843 : 368 - 379
  • [35] The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
    Eppstein, David
    GRAPH DRAWING, 2009, 5417 : 78 - 89
  • [36] Meta heuristic for graph drawing. Learning the optimal graph-drawing method for clustered graphs
    Niggemann, Oliver
    Stein, Benno
    Proceedings of the Workshop on Advanced Visual Interfaces, 2000, : 286 - 289
  • [37] Non-planar square-orthogonal drawing with few-bend edges
    Lin, Yu-An
    Poon, Sheung-Hung
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 150 - 168
  • [38] A GENERAL POSITION PROBLEM IN GRAPH THEORY
    Manuel, Paul
    Klavzar, Sandi
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2018, 98 (02) : 177 - 187
  • [39] GRAPH DRAWING BY THE MAGNETIC SPRING MODEL
    SUGIYAMA, K
    MISUE, K
    JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 1995, 6 (03): : 217 - 231
  • [40] The Binary Stress Model for Graph Drawing
    Koren, Yehuda
    Civril, Ali
    GRAPH DRAWING, 2009, 5417 : 193 - 205