Interactive orthogonal graph drawing

被引：11
|
作者：
Papakostas, A
Tollis, IG
机构：
[1] NEC Amer, Network Management Div, Irving, TX 75038 USA
[2] Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1998年 / 47卷 / 11期
关键词：
graph drawing; orthogonal graph drawing; interactive orthogonal graph drawing; information visualization; graphical user interface;
D O I：
10.1109/12.736444
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing of a graph. In this paper, we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenarios, present results on two of them. and compare their performance.
引用
收藏
页码：1297 / 1309
页数：13
相关论文
共 50 条
  • [21] Optimal Orthogonal Graph Drawing with Convex Bend Costs
    Blasius, Thomas
    Rutter, Ignaz
    Wagner, Dorothea
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (03)
  • [22] 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
    [J]. APPLIED SOFT COMPUTING, 2012, 12 (04) : 1379 - 1389
  • [23] Complexity results for three-dimensional orthogonal graph drawing
    Patrignani, Maurizio
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (01) : 140 - 161
  • [24] Fully dynamic 3-dimensional orthogonal graph drawing
    Closson, M
    Gartshore, S
    Johansen, J
    Wismath, SK
    [J]. GRAPH DRAWING, 1999, 1731 : 49 - 58
  • [25] Complexity results for three-dimensional orthogonal graph drawing
    Patrignani, M
    [J]. GRAPH DRAWING, 2006, 3843 : 368 - 379
  • [26] The complexity of bendless three-dimensional orthogonal graph drawing
    [J]. 2013, Brown University (17)
  • [27] Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
    Therese Biedl
    Torsten Thiele
    David R. Wood
    [J]. Algorithmica, 2006, 44 : 233 - 255
  • [28] The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
    Eppstein, David
    [J]. GRAPH DRAWING, 2009, 5417 : 78 - 89
  • [29] Three-dimensional orthogonal graph drawing with optimal volume
    Biedl, T
    Thiele, T
    Wood, DR
    [J]. ALGORITHMICA, 2006, 44 (03) : 233 - 255
  • [30] Analysis of a high-dimensional approach to interactive graph drawing
    Hosobe, Hiroshi
    [J]. Asia-Pacific Symposium on Visualisation 2007, Proceedings, 2007, : 93 - 96
12345