Refinement of three-dimensional orthogonal graph drawings

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

Volumn 1984, Issue , 2001, Pages 308-320

  Lynn, Benjamin Y S ^a   Symvonis, Antonios ^a   Wood, David R ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AESTHETIC CRITERIA; BOUNDING BOX; EDGE LENGTH; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS; REFINEMENT ALGORITHMS;

DRAWING (GRAPHICS);

EID: 0012782377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_29     Document Type: Conference Paper

References (14)

1. T. Biedl and T. Chan. Cross-coloring: improving the technique by Kolmogorov and Barzdin. Technical Report CS-2000-13, University of Waterloo, Canada, 2000.
2. M. Closson, S. Gartshore, J. Johansen, and S. K. Wismath. Fully dynamic 3- dimensional orthogonal graph drawing. In Kratochvil [8], pages 49-58.
3. G. Di Battista, M. Patrignani, and F. Vargiu. A split&push approach to 3D orthogonal drawing. In Whitesides [12], pages 87-101.
4. P. Eades, C. Stirk, and S. Whitesides. The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings. Inform. Proc. Lett., 60(2):97-103, 1996.
5. P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. Discrete Applied Math., 103:55-87, 2000.
6. U. Fößmeier, C. Heß, and M. Kaufmann. On improving orthogonal drawings: the 4M-algorithm. In Whitesides [12], pages 125-137.
7. A. N. Kolmogorov and Ya. M. Barzdin. On the realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261-268, March 1967.
8. J. Kratochvil, editor. Proc. Graph Drawing: 7th International Symp. (GD’99), volume 1731 of Lecture Notes in Comput. Sci., Springer, 1999.
9. A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999
10. M. Patrignani and F. Vargiu. 3DCube: a tool for three dimensional graph drawing. In G. Di Battista, editor, Proc. Graph Drawing: 5th International Symp. (GD'97), volume 1353 of Lecture Notes in Comput. Sci., pages 284-290, Springer, 1998.
11. J. M. Six, K. G. Kakoulis, and I. G. Tollis. Refinement of orthogonal graph drawings. In Whitesides [12], pages 302-315.
12. S. Whitesides, editor. Proc. Graph Drawing: 6th International Symp. (GD'98), volume 1547 of Lecture Notes in Comput. Sci., Springer, 1998.
13. D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Whitesides [12], pages 332-346.
14. D. R. Wood. Three-Dimensional Orthogonal Graph Drawing. PhD thesis, School of Computer Science and Software Engineering, Monash University, Australia, 2000.