On Orthogonally Convex Drawings of Plane Graphs
We investigate the bend minimization problem with respect to a new drawing style called orthogonally convex drawing, which is orthogonal drawing with an additional requirement that each inner face is drawn as an orthogonally convex polygon. For the class of bi-connected plane graphs of maximum degree 3, we give a necessary and sufficient condition for the existence of a no-bend orthogonally convex drawing, which in turn, enables a linear time algorithm to check and construct such a drawing if one exists. We also develop a flow network formulation for bend-minimization in orthogonally convex drawings, yielding a polynomial time solution for the problem. An interesting application of our orthogonally convex drawing is to characterize internally triangulated plane graphs that admit floorplans using only orthogonally convex modules subject to certain boundary constraints.
KeywordsBend minimization floorplan orthogonally convex drawing
- 1.Alam, Md. J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S. G., Ueckert, T.: Computing Cartograms with Optimal Complexity. In: Symposium on Computational Geometry (SoCG 2012), pp. 21–30 (2012)Google Scholar
- 2.Cornelsen, S., Karrenbauer, A.: Accelerated Bend Minimization. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 111–122. Springer, Heidelberg (2011)Google Scholar
- 4.Duncan, C.A., Goodrich, M.T.: Planar Orthogonal and Polyline Drawing Algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, ch. 7. CRC Press (2013)Google Scholar
- 13.Thomassen, C.: Plane Representations of Graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43–69. Academic Press, Canada (1984)Google Scholar