The three-phase method: A unified approach to orthogonal graph drawing

被引:10
|
作者
Biedl, TC [1 ]
Madden, BP
Tollis, IG
机构
[1] Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada
[2] Tom Sawyer Software, Albany, CA 94710 USA
[3] Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA
关键词
graph visualization; orthogonal graph drawing; high-degree graphs; three-phase method; interactive drawing;
D O I
10.1142/S0218195900000310
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings.
引用
收藏
页码:553 / 580
页数:28
相关论文
共 50 条
  • [1] The unified PWM implementation method for three-phase inverters
    Wen, Xiao-ling
    Yin, Xiang-gen
    [J]. IEEE IEMDC 2007: PROCEEDINGS OF THE INTERNATIONAL ELECTRIC MACHINES AND DRIVES CONFERENCE, VOLS 1 AND 2, 2007, : 241 - +
  • [2] Three-dimensional orthogonal graph drawing algorithms
    Eades, P
    Symvonis, A
    Whitesides, S
    [J]. DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 55 - 87
  • [3] An algorithm for three-dimensional orthogonal graph drawing
    Wood, DR
    [J]. GRAPH DRAWING, 1998, 1547 : 332 - 346
  • [4] Complexity results for three-dimensional orthogonal graph drawing
    Patrignani, Maurizio
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (01) : 140 - 161
  • [5] Complexity results for three-dimensional orthogonal graph drawing
    Patrignani, M
    [J]. GRAPH DRAWING, 2006, 3843 : 368 - 379
  • [6] The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
    Eppstein, David
    [J]. GRAPH DRAWING, 2009, 5417 : 78 - 89
  • [7] Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
    Therese Biedl
    Torsten Thiele
    David R. Wood
    [J]. Algorithmica, 2006, 44 : 233 - 255
  • [8] Three-dimensional orthogonal graph drawing with optimal volume
    Biedl, T
    Thiele, T
    Wood, DR
    [J]. ALGORITHMICA, 2006, 44 (03) : 233 - 255
  • [9] Colorability in orthogonal graph drawing
    Stola, Jan
    [J]. GRAPH DRAWING, 2008, 4875 : 327 - 338
  • [10] Issues in orthogonal graph drawing
    Papakostas, A
    Tollis, IG
    [J]. GRAPH DRAWING, 1996, 1027 : 419 - 430