Exploring density regions for analyzing dynamic graph data

被引:1
作者
Burch, Michael [1 ]
机构
[1] Univ Stuttgart, VISUS, Stuttgart, Germany
关键词
Dynamic graph visualization; Graph comparisons; Edge splatting; Isolines; Big graphs; VISUALIZATION;
D O I
10.1016/j.jvlc.2017.09.007
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Static or dynamic graphs are typically visualized by either node-link diagrams, adjacency matrices, adjacency lists, or hybrids thereof. In particular, for the case of a changing graph structure a viewer wishes to be able to visually compare the graphs in a sequence. Doing such a comparison task rapidly and reliably demands for visually analyzing the dynamic graph for certain dynamic patterns. In this paper we describe a novel dynamic graph visualization that is based on the concept of smooth density fields generated by first splatting the link information of a given graph in a certain layout or visual metaphor. To further visually enhance the time-varying graph structures we add user-adaptable isolines to the resulting dynamic graph representation. The computed visual encoding of the dynamic graph is aesthetically appealing due to its smooth curves and can additionally be used to do comparisons in a long graph sequence, i.e., from an information visualization perspective it serves as an overview representation supporting to start more detailed analysis processes. To demonstrate the usefulness of the technique we explore real -world dynamic graph data by taking into account visual parameters like visual metaphors, node-link layouts, smoothing iterations, number of isolines, and different color codings. In this extended work we additionally incorporate matrix and list splatting while also supporting the selection of density regions with overlaid link information. Moreover, from the selected graph the user can automatically apply region comparisons with other graphs based on global and local density properties. Such a feature is in particular useful for finding commonalities, hence serving as a special filtering function. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:133 / 144
页数:12
相关论文
共 43 条
  • [1] Aigner W, 2011, HUM-COMPUT INT-SPRIN, P1, DOI 10.1007/978-0-85729-079-3
  • [2] [Anonymous], 2001, LECT NOTES COMPUTER
  • [3] [Anonymous], 2002, 10 INT S GRAPH DRAWI
  • [4] [Anonymous], 1736, Commentarii Academiae Scientiarum Imperialis Petropolitanae
  • [5] [Anonymous], 2014, EUROVIS STARS
  • [6] [Anonymous], 1999, GRAPH DRAWING ALGORI
  • [7] [Anonymous], GRAPH DRAW 19 INT S
  • [8] Beck Fabian, 2013, 2013 17th International Conference on Information Visualisation, P11, DOI 10.1109/IV.2013.2
  • [9] Beck F., 2016, COMPUT GRAPHICS FORU
  • [10] Beck F, 2012, S VIS LANG HUM CEN C, P185, DOI 10.1109/VLHCC.2012.6344514