Smooth Orthogonal Layouts

Bekos, Michael A. and Kaufmann, Michael and Kobourov, Stephen G. and Symvonis, Antonios (2013) Smooth Orthogonal Layouts. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 150-161(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

Abstract

We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments and circular arcs with common tangents. Our goal is to create such layouts with low edge complexity, measured by the number of line and circular arc segments. We show that every biconnected 4-planar graph has a smooth orthogonal layout with edge complexity 3. If the input graph has a complexity-2 traditional orthogonal layout, we can transform it into a smooth complexity-2 layout. Using the Kandinsky model for removing the degree restriction, we show that any planar graph has a smooth complexity-2 layout.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-36763-2_14
Classifications: G Algorithms and Complexity > G.280 Canonical Ordering
P Styles > P.120 Circular
P Styles > P.600 Poly-line > P.600.300 Mainly Orthogonal
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 16:46
Last Modified: 21 Nov 2013 16:46
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1306

Actions (login required)

View Item View Item