On the orthogonal drawing of outerplanar graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 6, 2005, Pages 1583-1588

  Nomura, Kumiko ^a   Tayu, Satoshi ^a   Ueno, Shuichi ^a,b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b Graduate School of Science and Engineering   (Japan)

Author keywords

Bend; Orthogonal drawing; Outerplanar graph

Indexed keywords

DRAWING (FORMING);

BEND; ORTHOGONAL DRAWING; OUTERPLANAR GRAPH;

GRAPHIC METHODS;

EID: 25844490035     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e88-a.6.1583     Document Type: Conference Paper

References (14)

1. A. Aggarwal, M. Klawe, and P. Shor, "Multilayer and embeddings for VLSI," Algorithmic, vol.6, no.1, pp. 129-151, 1991.
2. G. Battista, G. Liotta, and F. Vargiu, "Spirality and optimal orthogonal drawings," SIAM J. Comput, vol.27, pp. 1764-1811, 1998.
3. T. Biedl and G. Kant, "A better heuristic for orthogonal graph drawings," LNCS, 855, pp.24-35, 1994.
4. P. Eades, C. Strik, and S. Whitesides, "The techniques of komolgorov and bardzin for three-dimensional orthogonal graph drawings," Inf. Process. Lett., vol.60, pp.97-103, 1996.
5. P. Eades, A. Symvonis, and S. Whitesides, "Three-dimensional orthogonal graph drawing algorithms," Discrete Appl. Math., vol.103, pp.55-87, 2000.
6. A. Garg and R. Tamassia, "On the computational complexity of upward and rectilinear planarity testing," SIAM J. Comput., vol.31, pp.601-625, 1995.
7. G. Kant, "Drawing planar graphs using the canonical ordering," Algorithmica, vol.16, pp.4-32, 1996.
8. F.T. Leighton and A.L. Rosenberg, "Three-dimensional circuit layouts," SIAM J. Comput., vol.15, no.3, pp.793-813, 1986.
9. Y. Liu, A. Morgana, and B. Simeone, "A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid," Discrete Appl. Math., vol.81, pp.69-91, 1998.
10. K. Nomura, S. Tayu, and S. Ueno, "On the orthogonal drawing of series-parallel graphs," IPSJ SIG Technical Report, 2004-AL-98, pp.25-32, 2004.
11. S.T. Obenaus and T.H. Szymanski, "Embedding of star graphs into optical meshes without bends," J. Parallel Distrib. Comput., vol.44, pp.97-106, 1997.
12. A. Papakostas and I.G. Tollis, "Algorithm for incremental orthogonal graph drawing in three dimensions," J. Graph Algorithms and Applications, vol.3, pp.81-115, 1999.
13. M.S. Rahman, M. Naznin, and T. Nishizeki, "Orthogonal drawing of plane graphs without bends," LNCS, 2265, pp.392-406, 2001.
14. D.R. Wood, "Optimal three-dimensional orthogonal graph drawing in the general position model," Theor. Comput. Sci., vol.299, pp. 151-178, 2003.