A Visualization Framework and User Studies for Overloaded Orthogonal Drawings

被引:8
作者
Didimo, Walter [1 ]
Kornaropoulos, Evgenios M. [2 ]
Montecchiani, Fabrizio [1 ]
Tollis, Ioannis G. [3 ,4 ]
机构
[1] Univ Perugia, Dipartimento Ingn, Perugia, Italy
[2] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
[3] Univ Crete, Iraklion, Greece
[4] Inst Comp Sci FORTH, Iraklion, Greece
关键词
user studies; interaction; information visualization; visualization; human-computer interfaces; QUASI-UPWARD PLANARITY; HYBRID VISUALIZATION; LAYOUT ALGORITHM; SOCIAL NETWORKS; MINIMUM NUMBER; GRAPHS; VARIANCE; SYSTEM; BENDS;
D O I
10.1111/cgf.13266
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular drawing conventions like layered drawings and orthogonal drawings, and provides additional support for some common analysis tasks. We present a visualization framework called DAGView, which implements algorithms and graphical features for the OOD style. Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize both digraphs with cycles and undirected graphs, with the additional possibility of taking into account user preferences and constraints. It also supports an interactive visualization of clustered digraphs, based on the use of strongly connected components. Moreover, we describe an experimental user study, aimed to investigate the usability of OOD within the DAGView framework. The results of our study suggest that OOD can be effectively exploited to perform some basic tasks of analysis in a faster and more accurate way when compared to other drawing styles for directed graphs.
引用
收藏
页码:288 / 300
页数:13
相关论文
共 62 条
  • [1] Matrix zoom: A visual interface to semi-external graphs
    Abello, J
    van Ham, F
    [J]. IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2004, PROCEEDINGS, 2004, : 183 - 190
  • [2] [Anonymous], 2013, Handbook of Graph Drawing and Visualization
  • [3] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
  • [4] [Anonymous], 1993, The Stanford graph base: A platform for combinatorial computing
  • [5] [Anonymous], MINING GRAPH DATA
  • [6] Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations
    Batagelj, Vladimir
    Brandenburg, Franz J.
    Didimo, Walter
    Liotta, Giuseppe
    Palladino, Pietro
    Patrignani, Maurizio
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (11) : 1587 - 1598
  • [7] A LAYOUT ALGORITHM FOR DATA FLOW DIAGRAMS
    BATINI, C
    NARDELLI, E
    TAMASSIA, R
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1986, 12 (04) : 538 - 546
  • [8] Matrix Reordering Methods for Table and Network Visualization
    Behrisch, Michael
    Bach, Benjamin
    Riche, Nathalie Henry
    Schreck, Tobias
    Fekete, Jean-Daniel
    [J]. COMPUTER GRAPHICS FORUM, 2016, 35 (03) : 693 - 716
  • [9] Quasi-upward planarity
    Bertolazzi P.
    Di Battista G.
    Didimo W.
    [J]. Algorithmica, 2002, 32 (3) : 474 - 506
  • [10] Computing orthogonal drawings with the minimum number of bends
    Bertolazzi, P
    Di Battista, G
    Didimo, W
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (08) : 826 - 840