Rectangular grid drawings of plane graphs

Computational Geometry: Theory and Applications

Volumn 10, Issue 3, 1998, Pages 203-220

  Rahman, Md Saidur ^a   Nakano, Shin Ichi ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithm; Floorplanning; Grid area; Grid drawing; Rectangular drawing

Indexed keywords

EID: 0039392554     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(98)00003-0     Document Type: Article

References (22)

1. J. Bhasker, S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica 3 (1988) 247-278.
2. T.C. Biedl, New lower bounds for orthogonal graph drawings, in: Proc. Graph Drawing '95, Lecture Notes in Computer Science 1027, 1996, pp. 28-39.
3. T.C. Biedl, Optimal orthogonal drawings of triconnected plane graphs, in: Proc. Scandinavian Workshop on Algorithm Theory, SWAT'96, Lecture Notes in Computer Science 1097, 1996, pp. 333-344.
4. N. Chiba, K. Onoguchi, T. Nishizeki, Drawing planar graphs nicely, Acta Informatica 22 (1985) 187-201.
5. M. Chrobak, S. Nakano, Minimum-width grid drawings of plane graphs, Technical Report, UCR-CS-94-5, Department of Computer Science, University of California at Riverside, 1994. Also in: Proc. Graph Drawing '94, Lecture Notes in Computer Science 894, pp. 104-110.
6. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications 4 (5) (1994) 235-282.
7. H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990) 41-51.
8. X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput. 22 (6) (1993) 1218-1226.
9. X. He, An efficient parallel algorithm for finding rectangular duals of plane triangulated graphs, Algorithmica 13 (1995) 553-572.
10. X. He, Grid embedding of 4-connected plane graphs, Discrete Comput. Geom. 17 (1997) 339-358.
11. G. Kant, X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theor. Comput. Sci. 172 (1997) 175-193.
12. 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, June 1984, pp. 655-656.
13. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990.
14. T. Nishizeki, N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.
15. M.S. Rahman, S. Nakano, T. Nishizeki, Rectangular grid drawings of plane graphs, in: Computing and Combinatorics, Proc. 2nd Annual International Conference, COCOON'96, Lecture Notes in Computer Science 1090, 1996, pp. 92-105.
16. W. Schnyder, Embedding planar graphs in the grid, in: Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 138-147.
17. J.A. Storer, On minimal node-cost planar embeddings, Networks 14 (1984) 181-212.
18. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (3) (1987) 421-444.
19. R. Tamassia, G. Di Battista, C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. Systems Man Cybernet. 18 (1988) 61-79.
20. R. Tamassia, I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits Systems 36 (9) (1989) 1230-1234.
21. K. Tani, S. Tsukiyama, S. Shinoda, I. Shirakawa, On area-efficient drawings of rectangular duals for VLSI floor-plan, Math. Programming 52 (1991) 29-43.
22. 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.