تخطى إلى المحتوى الرئيسي
واجهة جانبية
المزيد
العربية (ar)
Català (ca)
Deutsch (de)
Deutsch (du) (de_du)
English (en)
Español - Internacional (es)
Français (fr)
Italiano (it)
Português - Portugal (pt)
Svenska (sv)
Türkçe (tr)
Русский (ru)
العربية (ar)
أنت الآن تدخل بصفة ضيف
تسجيل الدخول
فتح فهرس المساق
الصفحة الرئيسية
Sommersemester 2020
Master- und Aufbaustudiengänge
SS20_VG
Literatur und zusätzliche Materialien
Lecture #7 [He 1993] On Finding the Rectangular Duals of Planar Triangular Graphs
Lecture #7 [He 1993] On Finding the Rectangular Duals of Planar Triangular Graphs
اضغط الوصلة
https://epubs.siam.org/doi/abs/10.1137/0222072
لفتح المصدر.
► Lecture #7 [de Fraysseix, de Mendez, Rosenstiehl 1994] On Triangle Contact Graphs
الانتقال إلى...
الانتقال إلى...
Forum
LaTeX template for exercise sheets
Exercise sheet #1: Drawing trees
Exercise sheet #2: Canonical orders
Exercise sheet #3: Schnyder realiser
Exercise sheet #4: Orthogonal drawings
Exercise sheet #5: Upward planar drawings
Exercise sheet #6: Hierarchical layouts
Exercise sheet #7: Contact representations
Exercise sheet #8: The Crossing Lemma
Exercise sheet #9: Force-Directed Methods
Exercise sheet #10: Visibility Representation
Lecture #1 [Reingold and Tilford 1981] Tidier Drawings of Trees
Lecture #1 [Supowit and Reingold 1983] The complexity of drawing trees nicely
Lecture #3 [Schnyder 1990] Embedding Planar Graphs on the Grid
Lecture #4 [Patrignani 2001] On the complexity of orthogonal compaction
Lecture #7 [de Fraysseix, de Mendez, Rosenstiehl 1994] On Triangle Contact Graphs
Lecture #7 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs
Lecture #8 [Székely 1997] Crossing numbers and hard Erdős problems in discrete geometry
Lecture #8 [Bienstock and Dean 1993] Bounds for rectilinear crossing numbers
Lecture #8 [Schaefer 2020] The Graph Crossing Number and its Variants: A Survey
Lecture #8 Terry Tao's blog on Crossing Numbers
Lecture #8 Movie "N Is a Number: A Portrait of Paul Erdös"
Lecture #9 Web interface for force-directed approaches
Lecture #10 [CGGKL18] The Partial Visibility Representation Extension Problem
Lecture #11 [Nöl14] A Survey on Automated Metro Map Layout Methods
Lecture #7 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs ◄