Rectangular drawings of planar graphs

Journal of Algorithms

Volumn 50, Issue 1, 2004, Pages 62-78

  Rahman, Md Saidur ^a,c   Nishizeki, Takao ^a   Ghosh, Shubhashis ^b,c  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF ALBERTA   (Canada)

^c Dept of CSE BUET   (India)

Author keywords

Algorithm; Graph drawing; Planar graph; Rectangular drawing

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGRATED CIRCUIT LAYOUT; THEOREM PROVING; VLSI CIRCUITS;

GRAPH DRAWING; LINEAR TIME ALGORITHM; PLANAR GRAPHS; RECTANGULAR DRAWINGS;

ALGORITHMS;

EID: 0347900659     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00126-3     Document Type: Article

References (19)

1. J. Bhasker, S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988) 247-278.
2. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.
3. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput. 22 (6) (1993) 1218-1226.
4. X. He, A simple linear time algorithm for proper box rectangular drawings of plane graphs, J. Algorithms 40 (1) (2001) 82-101.
5. J.E. Hopcroft, R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (3) (1973) 135-158.
6. G. Kant, X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci. 172 (1997) 175-193.
7. K. Kozminski, E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, in: Proc. 21st DAC, Albuquerque, 1984, pp. 655-656.
8. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990.
9. S. Munemoto, N. Katoh, G. Imamura, Finding an optimal floor layout based on an orthogonal graph drawing algorithm, J. Archit. Plann. Environ. Eng. AIJ 524 (2000) 279-286.
10. T. Nishizeki, N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.
11. M.S. Rahman, T. Nishizeki, S. Ghosh, Rectangular drawings of planar graphs (Extended abstract), in: Proc. of GD '02, in: Lecture Notes in Comput. Sci., Vol. 2528, Springer, 2002, pp. 244-255.
12. M.S. Rahman, S. Nakano, T. Nishizeki, Rectangular grid drawings of plane graphs, Comput. Geom. 10 (3) (1998) 203-220.
13. M.S. Rahman, S. Nakano, T. Nishizeki, A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs, J. Graph Algorithms Appl. 3 (4) (1999) 31-62.
14. M.S. Rahman, S. Nakano, T. Nishizeki, Box-rectangular drawings of plane graphs, J. Algorithms 37 (2) (2000) 363-398.
15. M.S. Rahman, S. Nakano, T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Comput. Geom. 21 (3) (2000) 121-138.
16. K. Tani, S. Tsukiyama, S. Shinoda, I. Shirakawa, On area-efficient drawings of rectangular duals for VLSI floor-plan, Math. Program. 52 (1991) 29-43.
17. C. Thomassen, Plane representations of graphs, in: J.A. Bondy, U.S.R. Murty (Eds.), Progress in Graph Theory, Academic Press, Canada, 1984, pp. 43-69.
18. C. Thomassen, Plane cubic graphs with prescribed face areas, Combin. Probab. Comput. 1 (1992) 371-381.
19. P. Ungar, On diagrams representing maps, J. London Math. Soc. 28 (1953) 336-342.