Rectangular Drawings of Planar Graphs

(Extended Abstract)
  • Md. Saidur Rahman
  • Takao Nishizeki
  • Shubhashis Ghosh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)


A plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, each vertex is drawn as a point, each edge is drawn as a horizontal or vertical line segment, and each face is drawn as a rectangle. A planar graph is said to have a rectangular drawing if at least one of its plane embeddings has a rectangular drawing. In this paper we give a linear-time algorithm to examine whether a planar graph G of the maximum degree three has a rectangular drawing or not, and to find a rectangular drawing of G if it exists.


Planar Graph Outer Face Linear Algorithm Plane Embedding Vertical Line Segment 
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. BS88.
    J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3, pp. 247–278, 1988.MATHCrossRefMathSciNetGoogle Scholar
  2. DETT99.
    G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis. Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.MATHCrossRefGoogle Scholar
  3. H93.
    X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 22(6), pp. 1218–1226, 1993.MATHCrossRefMathSciNetGoogle Scholar
  4. H01.
    X. He, A simple linear time algorithm for proper box rectangular drawings of plane graphs, Journal of Algorithms, 40(1), pp. 82–101, 2001.MATHCrossRefMathSciNetGoogle Scholar
  5. HT73.
    J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput., 2(3), pp. 135–158, 1973.CrossRefMathSciNetGoogle Scholar
  6. KH97.
    G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, 172, pp. 175–193, 1997.MATHCrossRefMathSciNetGoogle Scholar
  7. KK84.
    K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, Proc. 21st DAC, Albuquerque, pp. 655–656, 1984.Google Scholar
  8. L90.
    T. Lengauer, Combinatirial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.Google Scholar
  9. MKI00.
    S. Munemoto, N. Katoh and G. Imamura, Finding an optimal floor layout based on an orthogonal graph drawing algorithm, J. Archit. Plann. Enviroment Eng. AIJ, No. 524, pp. 279–286, 2000.Google Scholar
  10. NC88.
    T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.MATHCrossRefGoogle Scholar
  11. RNN98.
    M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Comp. Geom. Theo. Appl., 10(3), pp. 203–220, 1998.MATHMathSciNetGoogle Scholar
  12. RNN99.
    M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bendoptimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Alg. Appl., 3, No.4, pp. 31–62, 1999.MATHMathSciNetGoogle Scholar
  13. RNN00.
    M. S. Rahman, S. Nakano and T. Nishizeki, Box-rectangular drawings of plane graphs, Journal of Algorithms, 37(2), pp. 363–398, 2000.MATHCrossRefMathSciNetGoogle Scholar
  14. RNN02.
    M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Comp. Geom. Theo. Appl., 21(3), pp. 121–138, 2002.MATHMathSciNetGoogle Scholar
  15. TTSS91.
    K. Tani, S. Tsukiyama, S. Shinoda and I. Shirakawa, On area-efficient drawings of rectangular duals for VLSI floor-plan, Mathematical Programming, 52, pp. 29–43, 1991.MATHCrossRefMathSciNetGoogle Scholar
  16. T84.
    C. Thomassen, Plane representations of graphs, (Eds.) J. A. Bondy and U. S. R. Murty, Progress in Graph Theory, Academic Press Canada, pp. 43–69, 1984.Google Scholar
  17. T92.
    C. Thomassen, Plane cubic graphs with prescribed face areas, Combinatorics, Probability and Computing, 1, pp. 371–381, 1992.MATHMathSciNetCrossRefGoogle Scholar
  18. U53.
    P. Ungar, On diagrams representing maps, J. London Math. Soc., 28, pp. 336–342, 1953.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Md. Saidur Rahman
    • 1
  • Takao Nishizeki
    • 2
  • Shubhashis Ghosh
    • 3
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan
  2. 2.Graduate School of Information SciencesTohoku UniversitySendaiJapan
  3. 3.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations