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
Tasques
Tema | Tasques | Data de venciment | Tramesa | Qualificació |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | dijous, 30 d’abril 2020, 10:15 | ||
Exercise sheet #2: Canonical orders | diumenge, 10 de maig 2020, 09:00 | |||
Exercise sheet #3: Schnyder realiser | dijous, 14 de maig 2020, 10:15 | |||
Exercise sheet #4: Orthogonal drawings | dijous, 28 de maig 2020, 11:00 | |||
Exercise sheet #5: Upward planar drawings | dijous, 4 de juny 2020, 16:00 | |||
Exercise sheet #6: Hierarchical layouts | dijous, 18 de juny 2020, 10:15 | |||
Exercise sheet #7: Contact representations | dijous, 25 de juny 2020, 16:15 | |||
Exercise sheet #8: The Crossing Lemma | dijous, 2 de juliol 2020, 16:15 | |||
Exercise sheet #9: Force-Directed Methods | dijous, 9 de juliol 2020, 16:00 | |||
Exercise sheet #10: Visibility Representation | dijous, 16 de juliol 2020, 16:00 |