A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 296-307

  Nakano, Shin Ichi ^a   Yoshikawa, Makiko ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; DRAWING (GRAPHICS);

BEST-KNOWN ALGORITHMS; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; PLANAR EMBEDDING; PLANAR GRAPH; PLANE GRAPHS; VERTICAL LINES;

GRAPH THEORY;

EID: 23044525975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_28     Document Type: Conference Paper

References (10)

1. G. Di Battista, G. Liotta and F. Vargiu, Spirality of orthogonal represen- tations and optimal drawings of series-parallel graphs and 3-planar graphs, Proc. ofWorkshop on Algorithms and Data structures, LNCS 709, Springer (1993) 151-162.
2. A. Garg and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proc. of Graph Drawing'94, LNCS 894, Springer (1995) 286-297.
3. A. Garg and R. Tamassia, A new minimum cost flow algorithm with appli- cations to graph drawing, Proc. of Graph Drawing'96, LNCS 1190, Springer (1997) 201-226.
4. G. Kant, Drawing planar graphs using the canonical ordering, Algorith- mica, 16 (1996) 4-32.
5. G. Kant and X. He, Two algorithms for _nding rectangular duals of planar graphs, Proc. of WG'93, LNCS 790, Springer (1994) 396-410.
6. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Proc. of COCOON'96, LNCS 1090, Springer (1996) 92-105. Also, Computational Geometry: Theory and Applications, 10 (1998) 203- 220.
7. M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bend- optimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Algorithms and Applications, 3 (1999) 31-62.
8. M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular Drawings of Plane Graphs without Designated Corners, Proc. of COCOON'00, LNCS 1858, Springer (2000) 85-94.
9. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16 (1987) 421-444.
10. C. Thomassen, Plane representations of graphs, (Eds.) J.A. Bondy and U.S.R. Murty, Progress in Graph Theory, Academic Press Canada (1984) 43-69.