Optional Reading Material
All the information that is necessary to understand the material of the course is provided in the slides and during the lectures. Below you can find an additional reading that can be used in case you are interested in further details of the taught topics.
Books
- Graph Drawing: Algorithms for the Visualization of Graphs 1st edition, Ioannis G. Tollis, Giuseppe Di Battista, Peter Eades, Roberto Tamassia
- Handbook of Graph Drawing and Visualization, Roberto Tamassia, Editor, CRC Press (freely available online)
- Data Visualization - Principles and Practice 2nd edition, Alexandru Telea
Scientific Publications
Tree visualization
- Bubble Tree Drawing Algorithm (S. Grivet, David Auber, J.-P. Domenger, G. Melançon)
Force-directed algorithms
- Fruchterman-Reingold algorithm (T. M. J. Fruchterman, E. M. Reingold)
- Force-Atlas 2 algorithm (M. Jacomy, T. Venturini, S. Heymann, M. Bastian) - improvement over forces taking into account degrees of the nodes. The layout is implemented in Gephi software.
Layered layout algorithm
- A framework and algorithms for circular drawings of graphs (J. Six, I. Tollis) - describes fast computation of a number of crossings between two layers.
Multilayer graph visualization
- The State of the Art in Multilayer Network Visualization (F. McGee, M. Ghoniem, G. Melancon, B. Otjacques and B. Pinaud)
Graph bundling
- Force Directed Edge Bundling (D. Holten, J. J. van Wijk) The first general-purpose bundling algorithm in existence. Simple to implement but rather slow.
- Graph Bundling by Kernel Density Estimation (C. Hurter, O. Ersoy, A. Telea) An algorithm for general-purpose bundling, faster than force-directed, slightly more complex to implement.