2-Visibility Drawings of Planar Graphs

Fößmeier, Ulrich and Kant, Goos and Kaufmann, Michael (1997) 2-Visibility Drawings of Planar Graphs. In: Symposium on Graph Drawing, GD '96 , September 18-20, 1996 , pp. 155-168(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_45).

Full text not available from this repository.


In a 2-visibility drawing the vertices of a given graph are represented by rectangular boxes and the adjacency relations are expressed by horizontal and vertical lines drawn between the boxes. In this paper we want to emphasize this model as a practical alternative to other representations of graphs, and to demonstrate the quality of the produced grawings. We give several approaches, heuristics as well as provably good algorithms, to represent planar graphs within this model. To this, we present a polynomial time algorithm to compute a band-minimum orthogonal drawing under the restriction that the number of bends at each edge is at most 1.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_45
Classifications: P Styles > P.900 Visibility
G Algorithms and Complexity > G.210 Bends
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/63

Actions (login required)

View Item View Item