Slanted Orthogonal Drawings

Bekos, Michael A. and Kaufmann, Michael and Krug, Robert and Näher, Stefan and Roselli, Vincenzo (2013) Slanted Orthogonal Drawings. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 424-435(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_37).

Full text not available from this repository.

Abstract

We introduce a new model that we call slanted orthogonal graph drawing. While in traditional orthogonal drawings each edge is made of axis-aligned line-segments, in slanted orthogonal drawings intermediate diagonal segments on the edges are also permitted, which allows for: (a) smoothening the bends of the produced drawing (as they are replaced by pairs of “half-bends”), and, (b) emphasizing the crossings of the drawing (as they always appear at the intersection of two diagonal segments). We present an approach to compute bend-optimal slanted orthogonal representations, an efficient heuristic to compute close-to-optimal drawings in terms of the total number of bends using quadratic area, and a corresponding LP formulation, when insisting on bend optimality. On the negative side, we show that bend-optimal slanted orthogonal drawings may require exponential area.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.420 Crossings
P Styles > P.600 Poly-line > P.600.300 Mainly Orthogonal
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 15:39
Last Modified: 13 Aug 2014 15:39
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1394

Actions (login required)

View Item View Item