• DocumentCode
    3079345
  • Title

    Time spring layout for visualization of dynamic social networks

  • Author

    Peterson, Elisha

  • Author_Institution
    Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA
  • fYear
    2011
  • fDate
    22-24 June 2011
  • Firstpage
    98
  • Lastpage
    104
  • Abstract
    Common layout techniques for dynamic networks typically either keep node positions static as the graph changes, or operate by “tweening” optimized layouts between adjacent time slices. These techniques can be problematic because (in the first case) there is significant visual “noise” caused by unnecessary edge crossings, and (in the second case) the nodes change so much from one time slice to another that animation is required to display node movement. This paper describes techniques to balance the benefits of keeping node positions relatively static while allowing enough layout adjustment between slices to demonstrate the changing graph. Comparisons are provided against the common layout procedures for a graph with 20 time slices.
  • Keywords
    computer animation; data visualisation; graph theory; social networking (online); adjacent time slices; changing graph; dynamic graph visualization; dynamic social network visualization; layout adjustment; optimized layout tweening; time spring layout; visual noise; Data visualization; Force; Heuristic algorithms; Layout; Prediction algorithms; Springs; Visualization; algorithms; dynamic networks; longitudinal networks; visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Science Workshop (NSW), 2011 IEEE
  • Conference_Location
    West Point, NY
  • Print_ISBN
    978-1-4577-1049-0
  • Type

    conf

  • DOI
    10.1109/NSW.2011.6004630
  • Filename
    6004630