Talks and Poster Presentations (with Proceedings-Entry):
E. Argyriou, S. Cornelsen, H. Förster, M Kaufmann, M. Nöllenburg, Y. Okamoto, C. Raftopoulou, A. Wolff:
"Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity";
Talk: International Symposium on Graph Drawing and Network Visualization (GD),
Barcelona;
2018-09-26
- 2018-09-28; in: "Graph Drawing and Network Visualization (GD'2018)",
T. Biedl, A. Kerren (ed.);
Springer Lecture Notes in Computer Science,
11282
(2018),
509
- 523.
English abstract:
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of research effort in graph draw- ing has been directed towards the study of beyond-planar graphs such as 1-planar graphs, which admit a drawing where each edge is crossed at most once. In this paper, we consider graphs with a fixed embedding. For 1-planar graphs, we present algorithms that yield orthogonal drawings with optimal curve complexity and smooth orthogonal drawings with small curve complexity. For the subclass of outer-1-planar graphs, which can be drawn such that all vertices lie on the outer face, we achieve optimal curve complexity for both, orthogonal and smooth orthogonal drawings.
German abstract:
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of research effort in graph draw- ing has been directed towards the study of beyond-planar graphs such as 1-planar graphs, which admit a drawing where each edge is crossed at most once. In this paper, we consider graphs with a fixed embedding. For 1-planar graphs, we present algorithms that yield orthogonal drawings with optimal curve complexity and smooth orthogonal drawings with small curve complexity. For the subclass of outer-1-planar graphs, which can be drawn such that all vertices lie on the outer face, we achieve optimal curve complexity for both, orthogonal and smooth orthogonal drawings.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-030-04414-5_36
Electronic version of the publication:
https://arxiv.org/pdf/1808.10536.pdf
Created from the Publication Database of the Vienna University of Technology.