A Visualization Framework and User Studies for Overloaded Orthogonal Drawings

被引:9
作者
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 条
[61]  
Wybrow M., 2005, Graph Drawing. 13th International Symposium, GD 2005. Revised Papers (Lecture Notes in Computer Science Vol. 3843), P446
[62]  
Wybrow M., 2006, LNCS, V3843, P446