Practical Course: Graph Visualisation in Practice (Praktikum Graphenvisualisierung in der Praxis)
Summer semester 2017
- Class meets: Thursday 14:00 h, R-108, (Informatics Building 50.34)
- Credits: 5
- Module: Praktikum: Graphenvisualisierung in der Praxis [M-INFO-103302, Examination no. 2400037]
- Language: English
- Registration: Please register until 21/4/2017 by sending an email to both instructors. Please notice that the number of participants is limited to 9.
- Grading scheme: The final grade depends on: the successful completion of the project (70%), final presentation (20%) and the written documentation (10%).
- Prerequisites: The course is open only for the students who passed the course „Algorithms for Graph Visualization“.
- Registration open until 21/4/2017
- First lecture on Tuesday 27/4/2017
In this practical course we study the problem of maximizing the angular resolution in straight-line drawings of a graph, e.g. the smallest angle between any pair of crossing edges in a straight-line drawing. Determining whether a biconnected planar graph has an angular resolution greater then a constant is already NP-Hard. Thus, the aim of this course is to develop efficient heuristics to optimize the angular resolution of arbitrary graphs.
There are further details on the Graph Drawing Challenge Website.
In this course, participants will work in small groups on a selected optimisation problem in the area of graph visualization from a practical perspective. The aim is to produce, by the end of the course, an executable program which creates a particular layout style and solves the optimisation problem as well as possible. Specifically, the three main phases of the course are:
- Mastering the relevant existing literature on the subject
- Design of own solutions, based on adaptations and combinations of existing algorithms, as well as development of new heuristics
- Implementation and evaluation of the developed solutions
Online Graph Drawing Challenge
The teams with the best programs are encouraged and will be provided any necessary help to participate in the Graph Drawing Challenge held annually during the International Symposium on Graph Drawing & Network Visualization. The winners of the 2014 challenge in the automatic category are Alexander Khomenko, Igor Karlinsky, and Denis Knöpfle from KIT who implemented their software during the Graph Visualisation course 2013-2014.
General Reading on Graph Drawing
|[BETT99]||G. Di Battista, P. Eades, R. Tamassia, I. G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, 1999.|
|[KW01]||M. Kaufmann, D. Wagner: Drawing Graphs: Methods and Models, Springer-Verlag, 2001|
|[NR04]||T. Nishizeki, Md. S. Rahman: Planar Graph Drawing, World Scientific, 2004|
|[T13]||R. Tamassia: Handbook of Graph Drawing and Visualization, CRC Press, 2013.|