DocumentCode :
1784707
Title :
Perfect smooth orthogonal drawings
Author :
Bekos, M.A. ; Gronemann, M. ; Pupyrev, Sergey ; Raftopoulou, C.N.
Author_Institution :
Inst. fur Inf., Univ. Tubingen, Tubingen, Germany
fYear :
2014
fDate :
7-9 July 2014
Firstpage :
76
Lastpage :
81
Abstract :
Smooth orthogonal drawings were recently introduced with the view of combining two different graph drawing approaches: Orthogonal drawings and Lombardi drawings. In this paper, we focus on perfect smooth orthogonal drawings in which each edge is made of either a rectilinear segment or a circular arc. We prove that every 3-planar graph admits a planar perfect smooth orthogonal drawing. If we relax planarity constraints, we show that every graph of maximum degree 4 admits a (non-planar) perfect smooth orthogonal drawing. We demonstrate that there exist infinitely many planar graphs that do not admit planar perfect smooth orthogonal drawings under the Kandinsky model. Finally, we introduce classes of graphs admitting perfect smooth orthogonal drawings of different styles and study relations between these classes.
Keywords :
computational geometry; graph theory; 3-planar graph; Kandinsky model; Lombardi drawings; circular arc; graph drawing approach; perfect smooth orthogonal drawings; planarity constraints; rectilinear segment; Bridges; Complexity theory; Context; Layout; Ports (Computers); Shape; Skeleton;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information, Intelligence, Systems and Applications, IISA 2014, The 5th International Conference on
Conference_Location :
Chania
Type :
conf
DOI :
10.1109/IISA.2014.6878731
Filename :
6878731
Link To Document :
بازگشت