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. The best previous result generated a drawing bounded by an O( n)

• Type: Journal
• Year: 2000
• Where: DAM
• Authors: Peter Eades, Antonios Symvonis, Sue Whitesides
• Keywords: DAM 2000, Grid Drawings, Orthogonal Grid Drawings, Three-dimensional Grid Drawings