Graph streams have been studied extensively, such as for data mining, while fairly limitedly for visualizations. Recently, edge bundling promises to reduce visual clutter in large graph visualizations, though mainly focusing on static graphs. This paper presents a new framework, namely StreamEB, for edge bundling of graph streams, which integrates temporal, neighbourhood, data-driven and spatial compatibility for edges. Amongst these metrics, temporal and neighbourhood compatibility are introduced for the first time. We then present force-directed and tree-based methods for stream edge bundling. The effectiveness of our framework is then demonstrated using US flights data and Thompson-Reuters stock data. © 2013 Springer-Verlag.
CITATION STYLE
Nguyen, Q., Eades, P., & Hong, S. H. (2013). StreamEB: Stream edge bundling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7704 LNCS, pp. 400–413). https://doi.org/10.1007/978-3-642-36763-2_36
Mendeley helps you to discover research relevant for your work.