{"title":"Exploring density regions for analyzing dynamic graph data","authors":"Michael Burch","doi":"10.1016/j.jvlc.2017.09.007","DOIUrl":null,"url":null,"abstract":"<div><p>Static or dynamic graphs are typically visualized by either node-link diagrams, adjacency matrices<span>, adjacency lists<span>, 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.</span></span></p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"44 ","pages":"Pages 133-144"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.007","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Visual Languages and Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1045926X17301817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 2
Abstract
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.
期刊介绍:
The Journal of Visual Languages and Computing is a forum for researchers, practitioners, and developers to exchange ideas and results for the advancement of visual languages and its implication to the art of computing. The journal publishes research papers, state-of-the-art surveys, and review articles in all aspects of visual languages.