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 条
  • [41] The three-phase method: A unified approach to orthogonal graph drawing
    Biedl, TC
    Madden, BP
    Tollis, IG
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2000, 10 (06) : 553 - 580
  • [42] A graph theoretic approach to general Euler diagram drawing
    Stapleton, Gem
    Howse, John
    Rodgers, Peter
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (01) : 91 - 112
  • [43] A Steiner general position problem in graph theory
    Sandi Klavžar
    Dorota Kuziak
    Iztok Peterin
    Ismael G. Yero
    Computational and Applied Mathematics, 2021, 40
  • [44] A Steiner general position problem in graph theory
    Klavzar, Sandi
    Kuziak, Dorota
    Peterin, Iztok
    Yero, Ismael G.
    COMPUTATIONAL & APPLIED MATHEMATICS, 2021, 40 (06):
  • [45] Bounded degree book embeddings and three-dimensional orthogonal graph drawing
    Wood, DR
    GRAPH DRAWING, 2002, 2265 : 312 - 327
  • [46] A Multiobjective Genetic Algorithm for Automatic Orthogonal Graph Drawing [Track: Genetic Algorithms]
    Mendonca Neta, Bernadete M.
    Araujo, Gustavo H. D.
    Guimaraes, Frederico G.
    Mesquita, Renato C.
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 925 - 932
  • [47] Multi-dimensional orthogonal graph drawing with small boxes - Extended abstract
    Wood, DN
    GRAPH DRAWING, 1999, 1731 : 311 - 322
  • [48] The iteration time and the general position number in graph convexities
    Araujo, Julio
    Dourado, Mitre C.
    Protti, Fabio
    Sampaio, Rudini
    APPLIED MATHEMATICS AND COMPUTATION, 2025, 487
  • [49] USE OF A GENERAL GRAPH-DRAWING ALGORITHM IN THE CONSTRUCTION OF ASSOCIATION MAPS
    CRAVEN, TC
    PROCEEDINGS OF THE ASIS ANNUAL MEETING, 1992, 29 : 32 - 40
  • [50] General optimal model
    Liu, Kunhui
    Beifang Jiaotong Daxue Xuebao/Journal of Northern Jiaotong University, 1997, 21 (02): : 152 - 159