Algorithms for Drawing Plane Graphs

IEICE Transactions on Information and Systems

Volumn E87-D, Issue 2, 2004, Pages 281-289

  Nishizeki, Takao ^a   Miura, Kazuyuki ^a   Rahman, Md Saidur ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Box rectangular drawing; Convex drawing; Grid drawing; Orthogonal drawing; Plane graph; Rectangular drawing; Straight line drawing

Indexed keywords

ALGORITHMS; GEOMETRY; GRAPH THEORY;

BOX RECTANGULAR DRAWING; CONVEX DRAWING; GRID GRAWING; ORTHOGONAL DRAWING; PLANE GRAPHS; RECTANGULAR DRAWING; STRAIGHT LINE DRAWING;

DRAWING (GRAPHICS);

EID: 1442283742     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. J. Bhasker and S. Sahni, "A linear algorithm to find a rectangular dual of a planar triangulated graph," Algorithmica, vol.3, pp.247-278, 1988.
2. T.C. Biedl, "Optimal orthogonal drawings of triconnected plane graphs," Proc. SWAT '96, LNCS 1097, pp.333-344, 1996.
3. N. Chiba, K. Onoguehi, and T. Nishizeki, "Drawing planar graphs nicely," Acta Inform., vol.22, pp. 187-201, 1985.
4. N. Chiba, T. Yamanouchi, and T. Nishizeki, "Linear algorithms for convex drawings of planar graphs," in Progress in Graph Theory, ed. J.A. Bondy and U.S.R. Murty, pp. 153-173, Academic Press, 1984.
5. M. Chrobak and G. Kant, "Convex grid drawings of 3-connected planar graphs," Int. J. Comput. Geomet. Appl., vol.7, pp.211-223, 1997.
6. M. Chrobak and S. Nakano, "Minimum-width grid drawings of plane graphs," Computational Geometry: Theory and Applications, vol.10, pp.29-54, 1998.
7. M. Chrobak and T. Payne, "A linear-time algorithm for drawing planar graphs on a grid," Inf. Process. Lett., vol.54, pp.241-246, 1995.
8. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, "Automatic graph drawing: An annotated bibliography." Computational Geometry: Theory and Applications, vol.4, pp.235-282, 1994.
9. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing, Prentice Hall, NJ, 1999.
10. I. Fáry, "On straight lines representation of plane graphs," Acta Sci. Math. Szeged, vol.11, pp.229-233, 1948.
11. H. de Fraysseix, J. Pach, and R. Pollack, "How to draw a planar graph on a grid," Combinatorica, vol. 10, pp.41-51, 1990.
12. A. Garg and R. Tamassia, "A new minimum cost flow algorithm with applications to graph drawing," Proc. Graph Drawing'96, LNCS 1190, pp.201-226, 1996.
13. X. He, "On finding the rectangular duals of planar triangulated graphs," SIAM J. Comput., vol.22, no.6, pp.1218-1226, 1993.
14. X. He, "Grid embedding of 4-connected plane graphs," Discrete & Computational Geometry, vol.17, pp.339-358, 1997.
15. X. He, "A simple linear time algorithm for proper box-rectangular drawings of plane graphs," J. Algorithms, vol.40, no.1, pp.82-101, 2001.
16. G. Kant, "Drawing planar graphs using the canonical ordering," Algorithmica, vol.16, pp.4-32, 1996.
17. G. Kant and X. He. "Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems," Theor. Comput. Sci., vol.172, pp.175-193, 1997.
18. 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, pp.655-656, 1984.
19. T. Lengauer. Combinatirial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.
20. S. Munemoto, N. Katoh, and G. Imamura, "Finding an optimal floor layout based on an orthogonal graph drawing algorithm," J. Archit. Plann. Environment Eng. AIJ, vol.524, pp.279-286, 2000.
21. K. Miura, S. Nakano. and T. Nishizeki, "Grid drawings of four-connected plane graphs," Discrete & Computational Geometry, vol.26, pp.73-87, 2001.
22. K. Miura, S. Nakano, and T. Nishizeki, "Convex grid drawings of four-connected plane graphs," Proc. 11th Annual International Symposium on Algorithms and Computation (ISAAC '00), LNCS 1969, pp.254-265, 2000.
23. S. Nakano, M.S. Rahman, and T. Nishizeki, "A linear time algorithm for four partitioning four-connected planar graphs," Inf. Process. Lett., vol.62, pp.315-322, 1997.
24. M.S. Rahman and T. Nishizeki, "Bend-minimum orthogonal drawings of plane 3-graphs," Proc. WG '02, LNCS 2573, pp.265-276, 2002.
25. M.S. Rahman, S. Nakano, and T. Nishizeki, "Rectangular grid drawings of plane graphs," Comput. Geom. Theory Appl., vol.10, no.3, pp.203-220, 1998.
26. M.S. Rahman, S. Nakano, and T. Nishizeki, "A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs," J. Graph Alg. Appl., vol.3, no.4. pp.31-62, 1999.
27. M.S. Rahman, S. Nakano, and T. Nishizeki, "Box-rectangular drawings of plane graphs," J. Algorithms, vol.37, no.2, pp.363-398, 2000.
28. M.S. Rahman. S. Nakano, and T. Nishizeki, "Rectangular drawings of plane graphs without designated corners," Comput. Geom. Theory Appl., vol.21, no.3, pp.121-138, 2002.
29. W. Schnyder, "Embedding planar graphs in lie grid," Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, pp.138-147, San Francisco, 1990.
30. W. Schnyder and W. Trotter, "Convex drawings of planar graphs, " Abstracts of the AMS, vol.13, no.5, 92T-05-135, 1992.
31. S.K. Stein, "Convex maps," Proc. Amer. Math. Soc., vol.2, pp.464-466, 1951.
32. C. Thomassen, "Plane representations of graphs," in Progress in Graph Theory, ed. J.A. Bondy and U.S.R. Murty, pp.43-69, Academic Press Canada, 1984.
33. W.T. Tutte, "How to draw a graph," Proc. London Math. Soc., vol. 13, pp.743-768, 1963.
34. K. Wagner, "Bemerkungen zum vierfarbenproblem,'' Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.46, pp.26-32, 1936.