✦ LIBER ✦

Orthogonal Drawings Based On The Stratification Of Planar Graphs

✍ Scribed by Nicolas Bonichon; Bertrand Le Saëc; Mohamed Mosbah

Book ID: 108498113
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 178 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80118-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orthogonal drawings based on the stratif

Orthogonal drawings based on the stratification of planar graphs

✍ Nicolas Bonichon; Bertrand Le Saëc; Mohamed Mosbah 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 237 KB

We propose a linear time algorithm that associates with any planar graph G a stratiÿcation having a particular layered spanning tree of G. Using this stratiÿcation, an algorithm to obtain a 2-visibility drawing of G is described.

Lower bounds for planar orthogonal drawi

Lower bounds for planar orthogonal drawings of graphs

✍ Roberto Tamassia; Ioannis G. Tollis; Jeffrey Scott Vitter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Orthogonal drawings of graphs for the au

Orthogonal drawings of graphs for the automation of VLSI circuit design

✍ Yanpei Liu 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 923 KB

Convex Drawings of Planar Graphs and the

Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes

✍ Stefan Felsner 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 180 KB

How to draw the minimum cuts of a planar

How to draw the minimum cuts of a planar graph

✍ Ulrik Brandes; Sabine Cornelsen; Christian Fieß; Dorothea Wagner 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 321 KB

The techniques of Komolgorov and Bardzin

The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings

✍ Peter Eades; Charles Stirk; Sue Whitesides 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 674 KB