论文信息 - On the Orthogonal Drawing of Outerplanar Graphs

On the Orthogonal Drawing of Outerplanar Graphs

In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.

Kumiko Nomura | Satoshi Tayu | Shuichi Ueno

[1] David R. Wood,et al. Optimal three-dimensional orthogonal graph drawing in the general position model , 2003, Theor. Comput. Sci..

[2] Antonios Symvonis,et al. Three-dimensional orthogonal graph drawing algorithms , 2000, Discret. Appl. Math..

[3] Peter Eades,et al. The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings , 1996, Inf. Process. Lett..

[4] Tayu Satoshi,et al. On the Orthogonal Drawing of Series - Parallel Graphs , 2004 .

[5] Md. Saidur Rahman,et al. Orthogonal Drawings of Plane Graphs Without Bends , 2001, J. Graph Algorithms Appl..

[6] Yanpei Liu,et al. A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid , 1998, Discret. Appl. Math..

[7] Roberto Tamassia,et al. On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[8] Goos Kant,et al. Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

[9] Goos Kant,et al. A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[10] Ioannis G. Tollis,et al. Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions , 1999, J. Graph Algorithms Appl..

[11] Arnold L. Rosenberg,et al. Three-Dimensional Circuit Layouts , 1984, SIAM J. Comput..

[12] Giuseppe Liotta,et al. Spirality and Optimal Orthogonal Drawings , 1998, SIAM J. Comput..