Exploration of Networks Using Overview plus Detail with Constraint-based Cooperative Layout

被引:40
作者
Dwyer, Tim
Marriott, Kim [1 ]
Schreiber, Falk [2 ]
Stuckey, Peter J. [3 ,4 ]
Woodward, Michael
Wybrow, Michael [1 ,3 ]
机构
[1] Monash Univ, Clayton, Vic 3800, Australia
[2] IPK Gatersleben, Gatersleben, Germany
[3] Univ Melbourne, Melbourne, Vic 3010, Australia
[4] Natl ICT Australia, Sydney, NSW, Australia
关键词
Graph drawing; constraints; stress majorization; force directed algorithms; multidimensional scaling;
D O I
10.1109/TVCG.2008.130
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or by changing the level of detail of a node or cluster. For scalability, fast force-based layout algorithms are used for the overview and the detailed view. However, using the same layout algorithm in both views is problematic since layout for the detailed view has different requirements to that in the overview. Here we present a model in which constrained graph layout algorithms are used for layout in the detailed view. This means the detailed view has high-quality layout including sophisticated edge routing and is customisable by the user who can add placement constraints on the layout. Scalability is still ensured since the slower layout techniques are only applied to the small subgraph shown in the detailed view. The main technical innovations are techniques to ensure that the overview and detailed view remain synchronized, and modifying constrained graph layout algorithms to support smooth, stable layout. The key innovation supporting stability are new dynamic graph layout algorithms that preserve the topology or structure of the network when the user changes the focus node or the level of detail by in situ semantic zooming. We have built a prototype tool and demonstrate its use in two application domains, UML class diagrams and biological networks.
引用
收藏
页码:1293 / 1300
页数:8
相关论文
共 39 条
[21]   MetaCrop:: a detailed database of crop plant metabolism [J].
Grafahrend-Belau, Eva ;
Weise, Stephan ;
Koschuetzki, Dirk ;
Scholz, Uwe ;
Junker, Bjoern H. ;
Schreiber, Falk .
NUCLEIC ACIDS RESEARCH, 2008, 36 :D954-D958
[22]  
Hachul S, 2004, LECT NOTES COMPUT SC, V3383, P285
[23]  
HACHUL S, 2005, LNCS, P235
[24]   Constrained graph layout [J].
Weiqing H.E. ;
Marriott K. .
Constraints, 1998, 3 (4) :289-314
[25]  
HEER J, 2005, INFOVIS 05
[26]   ACE: A fast multiscale eigenvectors computation for drawing huge graphs [J].
Koren, Y ;
Carmel, L ;
Harel, D .
INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2002, 2002, :137-144
[27]  
Leung Y., 1994, ACM T COMPUT-HUM INT, V1, P126, DOI [DOI 10.1145/180171.180173, 10.1145/180171.180173]
[28]   LAYOUT ADJUSTMENT AND THE MENTAL MAP [J].
MISUE, K ;
EADES, P ;
LAI, W ;
SUGIYAMA, K .
JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 1995, 6 (02) :183-210
[29]  
North SC, 2002, LECT NOTES COMPUT SC, V2265, P232
[30]  
PERER A, 2006, T VISUALIZATION COMP, V12