Advertisement

SVEN: An Alternative Storyline Framework for Dynamic Graph Visualization

  • Dustin L. Arendt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)

Abstract

The world is a dynamic place, so when we use graphs to help understand real world problems the structure of such graphs inevitably changes over time. Understanding this change is important, but often challenging. Techniques for general purpose dynamic graph visualizations generally fall into one of two broad categories: animation or timeline based techniques [2]. Simple approaches using animation or small multiples experience challenges with change blindness and “preserving the user’s mental map” [1]. Storyline visualization techniques [5, 7] hold promise, though these techniques were not originally designed as general purpose solutions for dynamic graph visualization.

Keywords

Runtime Performance Change Blindness Hold Promise Aesthetic Criterion Dynamic Network Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Archambault, D., Purchase, H., Pinaud, B.: Animation, small multiples, and the effect of mental map preservation in dynamic graphs. IEEE Trans. Visual. Comput. Graph. 17(4), 539–552 (2011)CrossRefGoogle Scholar
  2. 2.
    Beck, F., Burch, M., Diehl, S., Weiskopf, D.: The State of the Art in Visualizing Dynamic Graphs. EuroVis, STAR (2014)Google Scholar
  3. 3.
    Liu, S., Wu, Y., Wei, E., Liu, M., Liu, Y.: StoryFlow: tracking the evolution of stories. IEEE Trans. Visual. Comput. Graph. 19(12), 2436–2445 (2013)CrossRefGoogle Scholar
  4. 4.
    Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for the maximum weighted independent set problem. Discrete Appl. Math. 126, 313–322 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Tanahashi, Y., Hsueh, C.H., Ma, K.L.: An efficient framework for generating storyline visualizations from streaming data. IEEE Trans. Visual. Comput. Graph. 6(1), 1–1 (2015)Google Scholar
  6. 6.
    Tanahashi, Y., Ma, K.L.: Design considerations for optimizing storyline visualizations. IEEE Trans. Visual. Comput. Graph. 18(12), 2679–2688 (2012)CrossRefGoogle Scholar
  7. 7.
    Vehlow, C., Beck, F., Auwärter, P., Weiskopf, D.: Visualizing the evolution of communities in dynamic graphs. Comput. Graph. Forum 34, 277–288 (2015)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Pacific Northwest National LaboratoryRichlandUSA

Personalised recommendations