Perfect Smooth Orthogonal Drawings

Bekos, Michael A. and Gronemann, Martin and Pupyrev, Sergey and Raftopoulou, Chrysanthi N. (2014) Perfect Smooth Orthogonal Drawings.
Published In: 5th International Conference on Information, Intelligence, Systems and Applications (IISA 2014) : Chania, Crete, Greece, 7 - 9 July 2014 IEEE 2014, pp. 76-81.

Abstract

Smooth orthogonal drawings were recently intro- duced 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.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Proceedings article
Citations: No citation data.
Uncontrolled Keywords:
Subjects:
  • 68-XX Computer science > 68Wxx Algorithms

  • Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Related URLs:
    Deposit Information:
    ZAIK Number: UNSPECIFIED
    Depositing User: Martin Gronemann
    Date Deposited: 05 Sep 2014 15:34
    Last Modified: 24 Nov 2015 09:47
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/876