Abstract
A plane graph is a planar graph with a fixed planar embedding in the plane. In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which the drawing of an edge changes its direction. A necessary and sufficient condition for a plane graph of maximum degree 3 to have a no-bend orthogonal drawing is known which leads to a linear-time algorithm to find such a drawing of a plane graph, if it exists. A planar graph G has a no-bend orthogonal drawing if any of the plane embeddings of G has a no-bend orthogonal drawing. Since a planar graph G of maximum degree 3 may have an exponential number of planar embeddings, determining whether G has a no-bend orthogonal drawing or not using the known algorithm for plane graphs takes exponential time. The best known algorithm takes \(O(n^{2})\) time for finding a no-bend orthogonal drawing of a biconnected planar graph of maximum degree 3. In this paper we give a linear-time algorithm to determine whether a biconnected planar graph G of maximum degree 3 has a no-bend orthogonal drawing or not and to find such a drawing of G, if it exists. We also give a necessary and sufficient condition for a biconnected planar graph G of maximum degree 3 to have a no-bend “orthogonally convex” drawing D; where any horizontal and vertical line segment connecting two points in a facial polygon P in D lies totally within P. Our condition leads to a linear-time algorithm for finding such a drawing, if it exists.
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
References
Chang, Y., Yen, H.: On bend-minimized orthogonal drawings of planar 3-graphs. In: Proceedings of 33rd International Symposium on Computational Geometry (SoCG 2017), pp. 29:1–29:15. Leibniz International Proceedings in Informatics (LIPICS), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany (2017)
Chang, Y., Yen, H.: On orthogonally convex drawings of plane graphs. Comput. Geom. Theory Appl. 62, 34–51 (2017)
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). https://doi.org/10.1007/11618058_37
Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. IEICE Trans. Inf. Syst. E88–D(1), 23–30 (2005)
Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)
Hasan, M.M., Rahman, M.S.: No-bend orthogonally convex drawings of subdivisions of planar triconnected cubic graphs. In: Proceedings of 3rd International Conference on Theoretical Computer Science and Discrete Mathematics (ICTCSDM 2018) (2018)
Battista, G.D., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764–1811 (1988)
Didimo, W., Liotta, G., Patrignani, M.: Bend-minimum orthogonal drawings in quadratic time. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 481–494. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04414-5_34
Rahman, M.S., Nakano, S., Nishizeki, T.: A linear algorithm for bend optimal orthogonal drawings of triconnected cubic plane graphs. J. Graph Algorithms Appl. (JGAA) 3(4), 31–62 (1999)
Rahman, M.S., Nakano, S., Nishizeki, T.: Box-rectangular drawings of plane graphs. J. Algorithms 37, 363–398 (2000)
Rahman, M.S., Nishizeki, T., Naznin, M.: Orthogonal drawings of plane graphs without bends. J. Graph Algorithms Appl. (JGAA) 7(4), 335–362 (2003)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
Rahman, M.S., Nishizeki, T.: Bend-minimum orthogonal drawings of plane 3-graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds.) WG 2002. LNCS, vol. 2573, pp. 367–378. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36379-3_32
Tamassia, R.: Handbook of Graph Drawing and Visualization. Discrete Mathematics and Its Applications, 1st edition. Chapman & Hall/CRC (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Hasan, M.M., Rahman, M.S. (2019). No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract). In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-26176-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26175-7
Online ISBN: 978-3-030-26176-4
eBook Packages: Computer ScienceComputer Science (R0)