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“.

News

Registration open until 21/4/2017

First lecture on Thursday 27/4/2017

Topic

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.

Structure

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