Record link: 
http://hdl.handle.net/20.500.12708/57813
-
Title: 
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
-
Citation: 
Argyriou, E., Cornelsen, S., Förster, H., Kaufmann, M., Nöllenburg, M., Okamoto, Y., Raftopoulou, C., & Wolff, A. (2018). Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. In T. Biedl & A. Kerren (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 509–523). Springer. https://doi.org/10.1007/978-3-030-04414-5_36
-
Publisher DOI: 
10.1007/978-3-030-04414-5_36
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Argyriou, Evmorfia 
Cornelsen, Sabine 
Förster, Henry 
Kaufmann, Michael 
Nöllenburg, Martin 
Okamoto, Yoshio 
Raftopoulou, Chrysanthi 
Wolff, Alexander 
-
Organisational Unit: 
E192-01 - Forschungsbereich Algorithms and Complexity 
-
Published in: 
Graph Drawing and Network Visualization. GD 2018 
-
ISBN: 
978-3-030-04414-5
-
Volume: 
11282
-
DOI of the book: 
10.1007/978-3-030-04414-5
-
Date (published): 
2018
-
Event name: 
26th International Symposium on Graph Drawing and Network Visualization (GD 2018) 
-
Event date: 
26-Sep-2018 - 28-Sep-2018
-
Event place: 
Barcelona, Spain
-
Number of Pages: 
15
-
Publisher: 
Springer, Cham
-
Peer reviewed: 
Yes
-
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.
en
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

123
checked on Nov 23, 2023

Google ScholarTM

Check