Graph Drawing (DA4124)
Professor |
Dr. Andreas Kerren, Associate Professor
|
Time & Place | Compare here (DA4124) |
Teaching Period | II (2008-11-03 till 2009-01-16)
|
Assessment | Assignments and oral examinations. Oral examinations will take place in week 4, between 19/1 and 23/1.
|
Prerequisites | At least two years of university studies (equal to 120 Swedish credit points),
including knowledge of algorithms and advanced data structures.
|
Credits | 7.5 ECTS
|
Topic | Graph Drawing
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. |
Schedule |
Preliminary Schedule:
| Materials |
Interestings URLs:
|
Assignments |
Assignments consists of theoretical and practical exercices.
You can find general information about our assignments on the first assignment sheet.
Assignments:
Groups:
|
Further Courses | There are further interesting courses in Spring 09 that uses the knowledge of the Graph drawing course: We permanently offer interesting topics for Bachelor's and Master's Theses that are related to graph drawing. |