GD
1997
Springer
13 years 9 months ago
1997
Springer
GD
1997
Springer
13 years 9 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
GD
1997
Springer
13 years 9 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
GD
1997
Springer
13 years 9 months ago
1997
Springer
GD
1997
Springer
13 years 9 months ago
1997
Springer
GD
1997
Springer
13 years 9 months ago
1997
Springer
GD
1997
Springer
13 years 9 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...