Graph Drawing (4DV802)
Prof. Dr. Andreas Kerren
|Time & Place||Compare here (4DV802)|
|Teaching Period|| II (2017-10-30 till 2018-01-12)
|Assessment|| Assignments and oral examinations. Oral examinations will take place in week 2 or 3.
|Prerequisites||At least 90 higher education credits of university studies in Computer Science including
a course on Algorithms and Advanced Data Structures.
|Credits|| 7.5 ECTS
This course will give an introduction to the most important techniques and approaches for drawing graphs and networks. The focus is on algorithms, and hence the course enables the student to implement own graph layout tools. Graph Drawing is an important subfield of Information Visualization. It is of great practical relevance for many industrial applications, such as software development, analysis of biochemical networks, etc. (see above images).
Complex information can be better perceived by using visual representations. Graph Drawing is a way of representing structural information as diagrams of abstract graphs and networks, i.e., of a set of nodes and edges as well as additional information. The aim is to develop algorithms that produce aesthetically appealing drawings! We will discuss drawing algorithms for general (directed and undirected) graphs, but also for special graphs, such as trees or directed acyclic graphs. Among others, the course will cover force-directed methods, layered drawings, orthogonal drawings, and dynamic graphs. Also, popular graph drawing software is discussed.
Furthermore, this course presents an information visualization view on Graph Drawing, such as interaction techniques, exploration, and labelling.
Graph Drawing Tools:
Assignments consist of theoretical and practical exercises.
They will be supervised by Kostiantyn Kucher.
You can find general information about our assignments on the first assignment sheet.
There are further interesting courses in Spring 19 that use the knowledge of the Graph Drawing course:topics for Bachelor's and Master's Theses that are related to graph drawing.