Abstract
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points. A plane graph G has a convex drawing if and only if G is internally triconnected, and an internally triconnected plane graph G has a convex grid drawing on an n ×n grid if G is triconnected or the triconnected component decomposition tree T(G) of G has two or three leaves, where n is the number of vertices in G. In this paper, we show that an internally triconnected plane graph G has a convex grid drawing on a 2n ×n 2 grid if T(G) has exactly four leaves. We also present an algorithm to find such a drawing in linear time. Our convex grid drawing has a rectangular contour, while most of the known algorithms produce grid drawings having triangular contours.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs-Extended Abstract. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 60–70. Springer, Heidelberg (2005)
Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications 7, 211–223 (1997)
Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing planar graphs nicely. Acta Inform. 22, 187–201 (1985)
Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 153–173. Academic Press, London (1984)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
Felsner, S.: Convex drawings of plane graphs and the order of dimension of 3-polytopes. Order 18, 19–37 (2001)
Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Compt. 2(3), 135–138 (1973)
Miura, K., Azuma, M., Nishizeki, T.: Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs. International Journal of Foundations of Computer Science 16(1), 117–141 (2005)
Miura, K., Azuma, M., Nishizeki, T.: Convex drawings of plane graphs of minimum outer apices. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 297–308. Springer, Heidelberg (2006), International Journal of Foundations of Computer Science (to appear)
Miura, K., Nakano, S., Nishizeki, T.: Convex grid drawings of four-connected plane graphs. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 254–265. Springer, Heidelberg (2000), International Journal of Foundations of Computer Science (to appear)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
Nakano, S., Rahman, M.S., Nishizeki, T.: A linear time algorithm for four partitioning four-connected planar graphs. Information Processing Letters 62, 315–322 (1997)
Schnyder, W., Trotter, W.: Convex drawings of planar graphs. Abstracts of the AMS 13(5), 92T-05-135 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kamada, A., Miura, K., Nishizeki, T. (2006). Convex Grid Drawings of Plane Graphs with Rectangular Contours. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_15
Download citation
DOI: https://doi.org/10.1007/11940128_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)