Graph Drawing (4DV802)
Prof. Dr. Andreas Kerren
|Time & Place||Compare here (4DV802)|
|Teaching Period|| II (2015-11-02 till 2016-01-15)
|Assessment|| Assignments and oral examinations. Oral examinations will take place in week 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
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.
Assignments consists of theoretical and practical exercices.
They will be supervised by Björn Zimmer.
You can find general information about our assignments on the first assignment sheet.
|Further Courses||There are further interesting courses in Spring 16 that use the knowledge of the Graph drawing course: topics for Bachelor's and Master's Theses that are related to graph drawing.|