Name
Abstract | ||
|---|---|---|
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 drawings. 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 bend-minimum orthogonal drawing under the restriction that the number of bends at each edge is at most 1. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-62495-3_45 | Graph Drawing |
Keywords | Field | DocType |
2-visibility drawings,planar graphs,planar graph | Adjacency list,Graph drawing,Discrete mathematics,Combinatorics,Outerplanar graph,Computer science,Chordal graph,Book embedding,Pathwidth,1-planar graph,Planar graph | Conference |
ISBN | Citations | PageRank |
3-540-62495-3 | 29 | 1.64 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulrich Fößmeier | 1 | 215 | 17.25 |
| Goos Kant | 2 | 565 | 51.19 |
| Michael Kaufmann | 3 | 1224 | 107.33 |