The DFS-heuristic for orthogonal graph drawing

被引：1
|
作者：
Biedl, T [1 ]
机构：
[1] Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2001年 / 18卷 / 03期
关键词：
orthogonal graph drawing; high-degree graphs; depth-first search;
D O I：
10.1016/S0925-7721(01)00006-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we present a new heuristic for orthogonal graph drawings, which creates drawings by performing a depth-first search and placing the nodes in the order they are encountered. This DFS-heuristic works for graphs with arbitrarily high degrees, and particularly well for graphs with maximum degree 3. It yields drawings with at most one bend per edge, and a total number of m - n + 1 bends for a graph with n nodes and m edges; this improves significantly on the best previous bound of m - 2 bends. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：167 / 188
页数：22
相关论文
共 50 条
  • [1] Colorability in orthogonal graph drawing
    Stola, Jan
    [J]. GRAPH DRAWING, 2008, 4875 : 327 - 338
  • [2] Issues in orthogonal graph drawing
    Papakostas, A
    Tollis, IG
    [J]. GRAPH DRAWING, 1996, 1027 : 419 - 430
  • [3] Orthogonal graph drawing with constraints
    Eiglsperger, M
    Fössmeier, U
    Kaufmann, M
    [J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 3 - 11
  • [4] Interactive orthogonal graph drawing
    Papakostas, A
    Tollis, IG
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (11) : 1297 - 1309
  • [5] PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS)
    Kurapov, S. V.
    Davidovsky, M. V.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2016, 32 (02): : 100 - 114
  • [6] Orthogonal Graph Drawing with Flexibility Constraints
    Blaesius, Thomas
    Krug, Marcus
    Rutter, Ignaz
    Wagner, Dorothea
    [J]. GRAPH DRAWING, 2011, 6502 : 92 - 104
  • [7] Orthogonal Graph Drawing with Flexibility Constraints
    Blaesius, Thomas
    Krug, Marcus
    Rutter, Ignaz
    Wagner, Dorothea
    [J]. ALGORITHMICA, 2014, 68 (04) : 859 - 885
  • [8] Orthogonal graph drawing with inflexible edges
    Blaesius, Thomas
    Lehmann, Sebastian
    Rutter, Ignaz
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2016, 55 : 26 - 40
  • [9] Algorithmic patterns for orthogonal graph drawing
    Gelfand, N
    Tamassia, R
    [J]. GRAPH DRAWING, 1998, 1547 : 138 - 152
  • [10] Orthogonal Graph Drawing with Flexibility Constraints
    Thomas Bläsius
    Marcus Krug
    Ignaz Rutter
    Dorothea Wagner
    [J]. Algorithmica, 2014, 68 : 859 - 885
12345