Online dynamic graph drawing.
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.
Frishman
Yaniv
Y
Department of Computer Science, Technion, Israel Institute of Technology, Haifa, Israel. frishman@tx.technion.ac.il
Tal
Ayellet
A
D000465:Algorithms; D003196:Computer Graphics; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D009716:Numerical Analysis, Computer-Assisted; D009862:Online Systems; D012815:Signal Processing, Computer-Assisted; D014584:User-Computer Interface