Sciweavers

DAM
2000
84views more  DAM 2000»
13 years 10 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides
GD
1997
Springer
14 years 3 months ago
Orthogonal 3-D Graph Drawing
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...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...