Three-dimensional orthogonal graph drawing algorithms Original Research Article

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. The best previous result generated a drawing bounded by an O(n)×O(n)×O(n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of bend/bounding box trade-off issues for three-dimensional grid drawings and produce drawings with the following characteristics: