Abstract
Static or dynamic graphs are typically visualized by either node-link diagrams, adjacency matrices, adjacency lists, orhybrids thereof. In particular, for the case of a changing graphstructure a viewer wishes to be able to visually compare thegraphs in a sequence. Doing such a comparison task rapidlyand reliably can give support to visually analyze the dynamicgraph 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 links of a given graph in a certain layout. 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 analyses processes. To demonstrate theusefulness of the technique we explore real-world dynamic graph data by taking into account visual parameters like node-link layouts, smoothing iterations, number of isolines, and different color codings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
