Title of article
Three-dimensional orthogonal graph drawing algorithms Original Research Article
Author/Authors
Peter Eades، نويسنده , , Antonios Symvonis، نويسنده , , Sue Whitesides، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
33
From page
55
To page
87
Abstract
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:
Keywords
Graph colouring , Graph theory , Graph drawing , Layout
Journal title
Discrete Applied Mathematics
Serial Year
2000
Journal title
Discrete Applied Mathematics
Record number
885094
Link To Document