✦ LIBER ✦

Interactive orthogonal graph drawing

✍ Scribed by Papakostas, A.; Tollis, I.G.

Book ID: 119772917
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 300 KB
Volume: 47
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.736444

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orthogonally Drawing Cubic Graphs in Par

Orthogonally Drawing Cubic Graphs in Parallel

✍ Tiziana Calamoneri; Rossella Petreschi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 417 KB

Three-Dimensional Orthogonal Graph Drawi

Three-Dimensional Orthogonal Graph Drawing with Optimal Volume

✍ Therese Biedl; Torsten Thiele; David R. Wood 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 291 KB

Efficient Orthogonal Drawings of High De

Efficient Orthogonal Drawings of High Degree Graphs

✍ A. Papakostas; I. G. Tollis 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 476 KB

Relating bends and size in orthogonal gr

Relating bends and size in orthogonal graph drawings

✍ Therese C. Biedl 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 474 KB

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 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.