Kursinformationen
Kursbeschreibung
This course discusses the most important algorithms for graph drawing. Many methods are imported from the Algorithmic Graph Theory lecture; such as: divide and conquer, network flows, integer programming and the planar separator theorem. We will discuss measures of the quality of graph drawings and algorithms to optimize them.
|
SS20: Visualisierung von Graphen
Inlämningsuppgifter
Ämne | Inlämningsuppgifter | Förfallodatum | Inlämning | Betyg |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | torsdag, 30 april 2020, 10:15 | ||
Exercise sheet #2: Canonical orders | söndag, 10 maj 2020, 09:00 | |||
Exercise sheet #3: Schnyder realiser | torsdag, 14 maj 2020, 10:15 | |||
Exercise sheet #4: Orthogonal drawings | torsdag, 28 maj 2020, 11:00 | |||
Exercise sheet #5: Upward planar drawings | torsdag, 4 juni 2020, 16:00 | |||
Exercise sheet #6: Hierarchical layouts | torsdag, 18 juni 2020, 10:15 | |||
Exercise sheet #7: Contact representations | torsdag, 25 juni 2020, 16:15 | |||
Exercise sheet #8: The Crossing Lemma | torsdag, 2 juli 2020, 16:15 | |||
Exercise sheet #9: Force-Directed Methods | torsdag, 9 juli 2020, 16:00 | |||
Exercise sheet #10: Visibility Representation | torsdag, 16 juli 2020, 16:00 |