On Rectilinear Drawing of Graphs

  • Peter Eades
  • Seok-Hee Hong
  • Sheung-Hung Poon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5849)


A rectilinear drawing is an orthogonal grid drawing without bends, possibly with edge crossings, without any overlapping between edges, between vertices, or between edges and vertices. Rectilinear drawings without edge crossings (planar rectilinear drawings) have been extensively investigated in graph drawing. Testing rectilinear planarity of a graph is NP-complete [10]. Restricted cases of the planar rectilinear drawing problem, sometimes called the “no-bend orthogonal drawing problem”, have been well studied (see, for example,[13],[14],[15] ).

In this paper, we study the problem of general non-planar rectilinear drawing; this problem has not received as much attention as the planar case. We consider a number of restricted classes of graphs and obtain a polynomial time algorithm, NP-hardness results, an FPT algorithm, and some bounds.

We define a structure called a “4-cycle block”. We give a linear time algorithm to test whether a graph that consists of a single 4-cycle block has a rectilinear drawing, and draw it if such a drawing exists. We show that the problem is NP-hard for the graphs that consist of 4-cycle blocks connected by single edges, as well as the case where each vertex has degree 2 or 4. We present a linear time fixed-parameter tractable algorithm to test whether a degree-4 graph has a rectilinear drawing, where the parameter is the number of degree-3 and degree-4 vertices of the graph. We also present a lower bound on the area of rectilinear drawings, and a upper bound on the number of edges.


Horizontal Edge Edge Crossing 3SAT Formula Angle Crossing Clause Gadget 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Aspvall, B., Plass, M., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters 8(3), 121–123 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. Journal of Systems and Software 4(2-3), 163–173 (1984)CrossRefGoogle Scholar
  3. 3.
    Biedl, T., Madden, B., Tollis, I.: The three-phase method: a unified approach to orthogonal graph drawing. Int. J. Comput. Geometry Appl. 10(6), 553–580 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Birkhoff, G.: Rectilinear drawing, in Three public lectures on scientific subjects. Three public lectures on scientific subjects 28(1), 51–76 (1941)MathSciNetGoogle Scholar
  5. 5.
    Bodlaender, H.L., Tel, G.: A note on rectilinearity and angular resolution. Journal of Graph Algorithms and Applications 8, 89–94 (2004)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol. 5664, pp. 206–217. Springer, Heidelberg (2009)Google Scholar
  7. 7.
    Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research 2, 147–161 (1984)Google Scholar
  8. 8.
    Eppstein, D.: The topology of bendless three-dimensional orthogonal graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 78–89. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., Woeginger, G.J.: Drawing graphs in the plane with high resolution. In: Proceedings of FOCS, pp. 86–95. IEEE, Los Alamitos (1990); SIAM Journal on Computing 22(5), 1035–1052 (1993)Google Scholar
  10. 10.
    Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing 31(2), 601–625 (2002)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Hoffman, F., Kriegel, K.: Embedding rectilinear graphs in linear time. Information Processing Letters 29(2), 75–79 (1988)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: Proceedings of PacificVis 2008, pp. 41–46. IEEE, Los Alamitos (2008)Google Scholar
  13. 13.
    Rahman, M. S., Naznin, M., Nishizeki, T.: Orthogonal drawings of plane graphs without bends. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 392–406. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of series-parallel graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 387–392. Springer, Heidelberg (2004)Google Scholar
  15. 15.
    Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of series-parallel graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 409–420. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM Journal on Computing 14(2), 355–372 (1985)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Peter Eades
    • 1
  • Seok-Hee Hong
    • 1
  • Sheung-Hung Poon
    • 2
  1. 1.School of Information TechnologiesUniversity of SydneyAustralia
  2. 2.Department of Computer ScienceNational Tsing Hua UniversityTaiwan, R.O.C.

Personalised recommendations