Skip to main content
Top

2016 | OriginalPaper | Chapter

1-Bend Upward Planar Drawings of SP-Digraphs

Authors : Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani

Published in: Graph Drawing and Network Visualization

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

It is proved that every series-parallel digraph whose maximum vertex-degree is \(\varDelta \) admits an upward planar drawing with at most one bend per edge such that each edge segment has one of \(\varDelta \) distinct slopes. This is shown to be worst-case optimal in terms of the number of slopes. Furthermore, our construction gives rise to drawings with optimal angular resolution \(\frac{\pi }{\varDelta }\). A variant of the proof technique is used to show that (non-directed) reduced series-parallel graphs and flat series-parallel graphs have a (non-upward) one-bend planar drawing with \(\lceil \frac{\varDelta }{2}\rceil \) distinct slopes if biconnected, and with \(\lceil \frac{\varDelta }{2}\rceil +1\) distinct slopes if connected.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)MathSciNetCrossRefMATH Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132–169 (1998)MathSciNetCrossRefMATH
3.
go back to reference Binucci, C., Didimo, W., Giordano, F.: Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3), 230–246 (2008)MathSciNetCrossRefMATH Binucci, C., Didimo, W., Giordano, F.: Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3), 230–246 (2008)MathSciNetCrossRefMATH
6.
go back to reference Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)MATH Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)MATH
9.
12.
go back to reference Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. Discret. Math. 23(4), 1842–1899 (2009)MathSciNetCrossRefMATH Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. Discret. Math. 23(4), 1842–1899 (2009)MathSciNetCrossRefMATH
13.
go back to reference Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)MathSciNetCrossRefMATH Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)MathSciNetCrossRefMATH
14.
go back to reference Jelínek, V., Jelínková, E., Kratochvíl, J., Lidický, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Gr. Combin. 29(4), 981–1005 (2013)MathSciNetCrossRefMATH Jelínek, V., Jelínková, E., Kratochvíl, J., Lidický, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Gr. Combin. 29(4), 981–1005 (2013)MathSciNetCrossRefMATH
15.
go back to reference Keszegh, B., Pach, J., Pálvölgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discret. Math. 27(2), 1171–1183 (2013)MathSciNetCrossRefMATH Keszegh, B., Pach, J., Pálvölgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discret. Math. 27(2), 1171–1183 (2013)MathSciNetCrossRefMATH
16.
17.
18.
go back to reference Lenhart, W., Liotta, G., Mondal, D., Nishat, R.I.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 412–423. Springer, Heidelberg (2013). doi:10.1007/978-3-319-03841-4_36 CrossRef Lenhart, W., Liotta, G., Mondal, D., Nishat, R.I.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 412–423. Springer, Heidelberg (2013). doi:10.​1007/​978-3-319-03841-4_​36 CrossRef
19.
go back to reference Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discr. Comput. Geom. 1, 343–353 (1986)MathSciNetCrossRefMATH Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discr. Comput. Geom. 1, 343–353 (1986)MathSciNetCrossRefMATH
20.
go back to reference Tamassia, R., Tollis, I.G.: A unified approach a visibility representation of planar graphs. Discr. Comput. Geom. 1, 321–341 (1986)MathSciNetCrossRefMATH Tamassia, R., Tollis, I.G.: A unified approach a visibility representation of planar graphs. Discr. Comput. Geom. 1, 321–341 (1986)MathSciNetCrossRefMATH
Metadata
Title
1-Bend Upward Planar Drawings of SP-Digraphs
Authors
Emilio Di Giacomo
Giuseppe Liotta
Fabrizio Montecchiani
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-50106-2_10

Premium Partner