Abstract
In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not cross. Our main focus is on bimodal graphs, i.e., digraphs admitting a planar embedding in which the incoming and outgoing edges around each vertex are contiguous. We show that every plane bimodal graph without 2-cycles admits a planar L-drawing. This includes the class of upward-plane graphs. Finally, outerplanar digraphs admit a planar L-drawing – although they do not always have a bimodal embedding – but not necessarily with an outerplanar embedding.
Sabine Cornelsen—The work of Sabine Cornelsen was funded by the German Research Foundation DFG – Project-ID 50974019 – TRR 161 (B06).
Giordano Da Lozzo—The work of Giordano Da Lozzo was partially supported by MIUR grants 20157EFM5C “MODE: MOrphing graph Drawings Efficiently” and 20174LF3T8 “AHeAD: efficient Algorithms for HArnessing networked Data”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G.: Planar L-drawings of bimodal graphs. Technical report arXiv:2008.07834v1, Cornell University Library (2020)
Angelini, P., et al.: Algorithms and bounds for L-drawings of directed graphs. Int. J. Found. Comput. Sci. 29(4), 461–480 (2018). https://doi.org/10.1142/S0129054118410010
Barth, W., Mutzel, P., Yıldız, C.: A new approximation algorithm for bend minimization in the Kandinsky model. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 343–354. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70904-6_33
Besa Vial, J.J., Da Lozzo, G., Goodrich, M.T.: Computing k-modal embeddings of planar digraphs. In: Bender, M.A., Svensson, O., Herman, G. (eds.) ESA 2019. LIPIcs, vol. 144, pp. 19:1–19:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.ESA.2019.19
Bhasker, J., Sahni, S.: A linear algorithm to find a rectangular dual of a planar triangulated graph. Algorithmica 3, 247–278 (1988). https://doi.org/10.1007/BF01762117
Biedl, T.C., Derka, M.: The (3,1)-ordering for 4-connected planar triangulations. JGAA 20(2), 347–362 (2016). https://doi.org/10.7155/jgaa.00396
Biedl, T.C., Mondal, D.: A note on plus-contacts, rectangular duals, and box-orthogonal drawings. Technical report arXiv:1708.09560v1, Cornell University Library (2017)
Binucci, C., Didimo, W., Patrignani, M.: Upward and quasi-upward planarity testing of embedded mixed graphs. Theoret. Comput. Sci. 526, 75–89 (2014). https://doi.org/10.1016/j.tcs.2014.01.015
Bläsius, T., Brückner, G., Rutter, I.: Complexity of higher-degree orthogonal graph embedding in the Kandinsky model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 161–172. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44777-2_14
Brückner, G.: Higher-degree orthogonal graph drawing with flexibility constraints. Bachelor thesis, Department of Informatics, Karlsruhe Institute of Technology (2013). https://i11www.iti.kit.edu/_media/teaching/theses/ba-brueckner-13.pdf
Chaplick, S., et al.: Planar L-drawings of directed graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 465–478. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73915-1_36
de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3(2), 233–246 (1994). https://doi.org/10.1016/j.comgeo.2017.11.001
Eiglsperger, M., Kaufmann, M.: Fast compaction for orthogonal drawings with vertices of prescribed size. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 124–138. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45848-4_11
Fößmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254–266. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0021809
He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22(6), 1218–1226 (1993). https://doi.org/10.1137/0222072
Kant, G.: A more compact visibility representation. Int. J. Comput. Geometry Appl. 7(3), 197–210 (1997). https://doi.org/10.1142/S0218195997000132
Kant, G., He, X.: Two algorithms for finding rectangular duals of planar graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 396–410. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-57899-4_69
Koźmiński, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15(2), 145–157 (1985). https://doi.org/10.1002/net.3230150202
Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16, 421–444 (1987). https://doi.org/10.1137/0216030
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G. (2020). Planar L-Drawings of Bimodal Graphs. In: Auber, D., Valtr, P. (eds) Graph Drawing and Network Visualization. GD 2020. Lecture Notes in Computer Science(), vol 12590. Springer, Cham. https://doi.org/10.1007/978-3-030-68766-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-68766-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-68765-6
Online ISBN: 978-3-030-68766-3
eBook Packages: Computer ScienceComputer Science (R0)