Fully dynamic 3-dimensional orthogonal graph drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1731, Issue , 1999, Pages 49-58

  Closson, M ^a   Gartshore, S ^a   Johansen, J ^a   Wismath, S K ^a  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

3-DIMENSIONAL; GRID POINTS; INTEGER LATTICE; LAYOUT SCHEMES; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS; SELF LOOPS;

GRAPH THEORY;

EID: 84958952144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_5     Document Type: Conference Paper

References (6)

1. T. Biedl, Heuristics for 3D-Orthogonal Graph Drawings, Proceedings of the 4th Twente Workshop on Graphs and Combinatorial Optimization, Enshende, June 1995, pp. 41-44.
2. T. Biedl, T. Shermer, S. Whitesides, S. Wismath, Three-Dimensional Orthogonal Graph Drawing, Symposium on Graph Drawing 97, Lecture Notes in Computer Science 1353, Springer Verlag, 1998, pp. 76-86.
3. G. Di Battista, M. Patrignani, F. Vargiu, A Split & Push Approach to 3D Or-thogonal Drawing, Symposium on Graph Drawing 98, Lecture Notes in Computer Science 1547, Springer Verlag, 1998. pp.87-101.
4. P. Eades, A. Symvonis, S. Whitesides, Two Algorithms for Three-Dimensional Orthogonal Graph Drawing, Symposium on Graph Drawing 96, Lecture Notes in Computer Science 1190, Springer Verlag, 1996, pp. 139-154.
5. A. Papakostas, I. Tollis, Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions, J. of Graph Algorithms and Applications, to appear.
6. D. Wood, An Algorithm for Three-Dimensional Orthogonal Graph Drawing, Sym-posium on Graph Drawing 98, Lecture Notes in Computer Science 1547, Springer Verlag, 1998. pp.332-346.