Algorithms and Area Bounds for Nonplanar Orthogonal Drawings

Fößmeier, Ulrich and Kaufmann, Michael (1998) Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 134-145(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_57).

Full text not available from this repository.

Abstract

We report on some extensions of the Kandinsky model: A new and highly nontrivial technique to incorporate nonplanar drawings into the Kandinsky model in the same way as in the GIOTTO approach is presented. This means a major step towards the practical usability of our approach. The used technique even gives new insights for the solvability of network flow problems. Another variant of Kandinsky ensures a minimal size of the vertices removing the requirement of uniform size of each vertex. We present a new technique to evaluate our approach with the respect to the area and the number of bends, and to perform a reasonable comparison with the GIOTTO approach.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_57
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.840 Planarization
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/74

Actions (login required)

View Item View Item