Abstract
A convex drawing of a plane graph G is a plane drawing of G, where each vertex is drawn as a point, each edge is drawn as a straight line segment and each face is drawn as a convex polygon. A maximal segment is a drawing of a maximal set of edges that form a straight line segment. A minimum-segment convex drawing of G is a convex drawing of G where the number of maximal segments is the minimum among all possible convex drawings of G. In this paper, we present a linear-time algorithm to obtain a minimum-segment convex drawing Γ of a 3-connected cubic plane graph G of n vertices, where the drawing is not a grid drawing. We also give a linear-time algorithm to obtain a convex grid drawing of G on an \((\frac{n}{2}+1)\times (\frac{n}{2}+1)\) grid with at most s n + 1 maximal segments, where \(s_n=\frac{n}{2}+3\) is the lower bound on the number of maximal segments in a convex drawing of G.
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
Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing plane graphs nicely. Acta Informatica 22(2), 187–201 (1985)
Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Progress in Graph Theory, pp. 153–173 (1984)
Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications 7(3), 211–223 (1997)
Dujmović, V., Suderman, M., Wood, D.R.: Really straight graph drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 122–132. Springer, Heidelberg (2005)
Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 263–276. Springer, Heidelberg (1993)
Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4–32 (1996)
Keszegh, B., Pach, J., Pálvölgyi, D., Tóth, G.: Drawing cubic graphs with at most five slopes. Computational Geometry 40(2), 138–147 (2008)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
Samee, M.A.H., Alam, M.J., Adnan, M.A., Rahman, M.S.: Minimum segment drawings of series-parallel graphs with the maximum degree three. In: 16th International Symposium on Graph Drawing, pp. 408–419. Springer, Heidelberg (2009)
Tutte, W.T.: Convex representations of graphs. London Mathematical Society 10, 304–320 (1960)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biswas, S., Mondal, D., Nishat, R.I., Rahman, M.S. (2010). Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs . In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-14031-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14030-3
Online ISBN: 978-3-642-14031-0
eBook Packages: Computer ScienceComputer Science (R0)