Abstract
A monotone drawing of a planar graph G is a planar straight-line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this paper we study monotone grid drawings of planar graphs in a variable embedding setting. We show that every connected planar graph of n vertices has a monotone grid drawing on a grid of size O(n)×O(n 2), and such a drawing can be found in O(n) time. Our result immediately resolves two open problems on monotone drawings of planar graphs posted by Angelini et al.
This is a preview of subscription content, log in via an institution to check access.
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
Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. Journal of Graph Algorithms and Applications 16(1), 5–35 (2012)
Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone drawings of graphs with fixed embedding. Algorithmica, 1–25 (2013)
Arkin, E.M., Connelly, R., Mitchell, J.B.: On monotone paths among obstacles with applications to planning assemblies. In: Proceedings of the Fifth Annual Symposium on Computational Geometry, SCG 1989, pp. 334–343. ACM, New York (1989)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)
Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science 61(2–3), 175–198 (1988)
Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135–158 (1973)
Hossain, M. I., Rahman, M. S.: Straight-line monotone grid drawings of series-parallel graphs. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 672–679. Springer, Heidelberg (2013)
Huang, W., Eades, P., Hong, S.-H.: A graph reading behavior: Geodesic-path tendency. In: Proceedings of the 2009, IEEE Pacific Visualization Symposium, PACIFICVIS 2009, pp. 137–144. IEEE Computer Society, Washington, DC (2009)
Nishizeki, T., Rahman, M. S.: Planar Graph Drawing. Lecture notes series on computing. World Scientific, Singapore (2004)
Hassan Samee, M.A., Rahman, M.S.: Upward planar drawings of series-parallel digraphs with maximum degree three. In: WALCOM 2007, pp. 28–45 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hossain, M.I., Rahman, M.S. (2014). Monotone Grid Drawings of Planar Graphs. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)