154
Voted
GD
1997
Springer
16 years 2 days ago
1997
Springer
211
Voted
GD
1997
Springer
16 years 2 days 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 ...
225
Voted
GD
1997
Springer
16 years 2 days 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...
167
Voted
GD
1997
Springer
16 years 2 days ago
1997
Springer
154
Voted
GD
1997
Springer
16 years 2 days ago
1997
Springer
159
Voted
GD
1997
Springer
16 years 2 days ago
1997
Springer
193
Voted
GD
1997
Springer
16 years 2 days 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...
161
Voted
DCC
1996
IEEE
16 years 3 days ago
1996
IEEE
144
Voted
DCC
1996
IEEE
16 years 3 days ago
1996
IEEE
160
Voted
DCC
1996
IEEE
16 years 3 days ago
1996
IEEE
