## Orthogonal 3-D Graph Drawing
Biedl, Therese and Shermer, Thomas and Whitesides, Sue and Wismath, Stephen
(1998)
Full text not available from this repository. ## AbstractThis paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular, with vertices drawn as boxes. It establishes an asymptotic lower bound for the volume of the bounding box of such drawings and exhibits a construction that achieves this bound. No edge route in this unconstrained construction bends more than three times. For drawings constrained to have at most k bends on any edge route, simple constructions are given for k=1 and k=2. The unconstrained construction handles the k \geq 3 cases, while for k=0 (no bends), it is proved here that not all graphs can be drawn.
Repository Staff Only: item control page References |