| Themen und Vorlesungen |
 Lecture #1: Introduction |
|
|
Lecture #1: Introduction short |
|
|
Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs |
|
|
Lecture #1: Divide and Conquer Algorithms for Trees and Series-Parallel Graphs short |
|
|
Lecture #2: Force-Directed Algorithms |
|
|
Lecture #2: Force-Directed Algorithms short |
|
|
Lecture #3: Planar straight-line drawings with shift method |
|
|
Lecture #3: Planar straight-line drawings with shift method short |
|
|
Lecture #4: Planar Straight-Line Drawings with Schnyder Woods |
|
|
Lecture #4: Planar Straight-Line Drawings with Schnyder Woods short |
|
|
Lecture #5: Orthogonal Layouts |
|
|
Lecture #5: Orthogonal Layouts short |
|
|
Lecture #6: Upward Planar Drawings |
|
|
Lecture #6: Upward Planar Drawings short |
|
|
 Lecture video #6a: Upward Planarity Intro |
|
|
Lecture video #6b: Upward Planarity Testing |
|
|
Lecture #7: Hierarchical Layouts |
|
|
Lecture #7: Hierarchical Layouts short |
|
|
Lecture #8: Contact Representations |
|
|
Lecture #8: Contact Representations short |
|
|
Lecture #9: SPQR-trees and Partial Bar Visibility Representation Extension |
|
|
Lecture #9: SPQR-trees and Partial Bar Visibility Representation Extension short |
|
|
Lecture #10: The Crossing Lemma |
|
|
Lecture #10: The Crossing Lemma short |
|
|
Lecture #11: Beyond Planarity |
|
|
Lecture #11: Beyond Planarity short |
|
|
Lecture #12: Octilinear Graph Drawing of Metro Maps |
|
|
Lecture #12: Octilinear Graph Drawing of Metro Maps short |
|
|
| Literatur und zusätzliche Materialien |
 Lecture #1 Supplemental Material: Compendium of Drawing Methods for Trees |
|
|
Lecture #1 [Reingold and Tilford 1981] Tidier Drawings of Trees |
|
|
Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely |
This paper shows that one can use LP-based methods to minimize the width of a "balanced-layered" drawing of tree, but if one desires a grid drawing the problem becomes NP-hard. |
|
Lecture #2 Web demo for force-directed approaches |
Implemented by Philipp Kindermann.
Another website is this one here http://www.yasiv.com/graphs#
which also has a live demo environment (with configurable constants) and many example graphs drawn via force-directed methods. |
|
Lecture #4 [Schnyder 1990] Embedding Planar Graphs on the Grid |
|
|
Lecture #5 [Patrignani 2001] On the complexity of orthogonal compaction |
Lecture #3: reference for the NP-hardness proof regarding optimally "compactifying" an orthogonal drawing of an embedded graph. |
|
Lecture #8 [de Fraysseix, de Mendez, Rosenstiehl 1994] On Triangle Contact Graphs |
|
|
Lecture #8 [He 1993] On Finding the Rectangular Duals of Planar Triangular Graphs |
|
|
Lecture #8 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs |
|
|
Lecture #9 [CGGKL18] The Partial Visibility Representation Extension Problem |
|
|
Lecture #10 [Székely 1997] Crossing numbers and hard Erdős problems in discrete geometry |
This paper contains several applications of the crossing lemma. Be warned that the presentation is a bit dense at times. |
|
Lecture #10 [Bienstock and Dean 1993] Bounds for rectilinear crossing numbers |
|
|
Lecture #10 [Schaefer 2020] The Graph Crossing Number and its Variants: A Survey |
|
|
Lecture #10 Terry Tao's blog on Crossing Numbers |
Terry Tao's blog entry on the crossing inequality.
|
|
Lecture #10 Movie "N Is a Number: A Portrait of Paul Erdös" |
|
|
Lecture #12 [Nöl14] A Survey on Automated Metro Map Layout Methods |
|
|
Lecture #1-12: Bonus Summary |
|
