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
Tareas
Tema | Tareas | Fecha de entrega | Entrega | Calificación |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | jueves, 30 de abril de 2020, 10:15 | ||
Exercise sheet #2: Canonical orders | domingo, 10 de mayo de 2020, 09:00 | |||
Exercise sheet #3: Schnyder realiser | jueves, 14 de mayo de 2020, 10:15 | |||
Exercise sheet #4: Orthogonal drawings | jueves, 28 de mayo de 2020, 11:00 | |||
Exercise sheet #5: Upward planar drawings | jueves, 4 de junio de 2020, 16:00 | |||
Exercise sheet #6: Hierarchical layouts | jueves, 18 de junio de 2020, 10:15 | |||
Exercise sheet #7: Contact representations | jueves, 25 de junio de 2020, 16:15 | |||
Exercise sheet #8: The Crossing Lemma | jueves, 2 de julio de 2020, 16:15 | |||
Exercise sheet #9: Force-Directed Methods | jueves, 9 de julio de 2020, 16:00 | |||
Exercise sheet #10: Visibility Representation | jueves, 16 de julio de 2020, 16:00 |