Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Martin Nöllenburg, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander
January 2018
PDF bib DOI

Abstract

Full Citation:

Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Nöllenburg, Martin, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander. Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 509-523, 2018, Springer International Publishing.

Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.