On Orthogonally Convex Drawings of Plane Graphs (Extended Abstract)

Chang, Yi-Jun and Yen, Hsu-Chun (2013) On Orthogonally Convex Drawings of Plane Graphs (Extended Abstract). In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 400-411 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_35).

Full text not available from this repository.


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.

Item Type:Conference Paper
Classifications:G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:1392

Repository Staff Only: item control page


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)

Cornelsen, S., Karrenbauer, A.: Accelerated Bend Minimization. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 111–122. Springer, Heidelberg (2011)

Di Battista, G., Liotta, G., Vargiu, F.: Spirality and Optimal Orthogonal Drawings. SIAM Journal on Computing 27(6), 1764–1811 (1998)

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)

Garg, A., Tamassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM Journal on Computing 31(2), 601–625 (2001)

Kozminski, K., Kinnen, E.: Rectangular Dual of Planar Graphs. Networks 15, 145–157 (1985)

Miura, K., Haga, H., Nishizeki, T.: Inner Rectangular Drawings of Plane Graphs. International Journal of Computational Geometry and Applications 16(2-3), 249–270 (2006)

Rahman, M. S., Egi, N., Nishizeki, T.: No-bend Orthogonal Drawings of Series-Parallel Graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 409–420. Springer, Heidelberg (2006)

Rahman, M.S., Nakano, S., Nishizeki, T.: A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. Journal of Graph Algorithms and Applications 3, 31–62 (1999)

Rahman, M.S., Nishizeki, T.: Orthogonal Drawings of Plane Graphs Without Bends. Journal of Graph Algorithms and Applications 7, 335–362 (2003)

Sun, Y., Sarrafzadeh, M.: Floorplanning by Graph Dualization: L-shaped Modules. Algorithmica 10, 429–456 (1993)

Tamassia, R.: On Embedding a Graph in the Grid with the Minimum Number of Bends. SIAM Journal on Computing 16, 421–444 (1987)

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)

Yeap, K., Sarrafzadeh, M.: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules. SIAM Journal on Computing 22, 500–526 (1993)