Slanted Orthogonal Drawings
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.
KeywordsPlanarized Graph Linear Program Formulation European Social Fund Planar Drawing Orthogonal Representation
- 6.Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: 21st Symposium on Foundations of Computer Science, vol. 1547, pp. 270–281. IEEE (1980)Google Scholar