Incremental orthogonal graph drawing in three dimensions

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

Volumn 1353, Issue , 1997, Pages 52-63

  Papakostas, Achilleas ^a   Tollis, Ioannis G ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

LINEAR TIME; MAXIMUM DEGREE; ORTHOGONAL GRAPHS; THREE DIMENSIONAL SPACE; THREE DIMENSIONS;

DRAWING (GRAPHICS);

EID: 21944436613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_50     Document Type: Conference Paper

References (20)

1. T. Biedl and G. Kant, A Better Heuristic for Orthogonal Graph Drawings, Proc. 2nd Ann. European Symposium on Algorithms (ESA ‘94), Lecture Notes in Computer Science, vol. 855, pp. 24-35, Springer-Verlag, 1994.
2. M. Brown and M. Najork, Algorithm animation using 3D interactive graphics, Proc. ACM Syrup. on User Interface Software and Technology, 1993, pp. 93-100.
3. I. Bruss and A. Frick, Fast Interactive 3-D Visualization, Proc. of Workshop GD '95, Lecture Notes in Comp. Sci. 1027, Sprlnger-Verlag, 1995, pp. 99-110.
4. R. Cohen, P. Eades, T. Lin, F. Ruskey, Three Dimensional Graph Drawing, Proc. of DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 1-11.
5. I. Cruz and J. Twarog, 3D Graph Drawing with Simulated Annealing, Proc. of Workshop GD '95, Lecture Notes in Comp. Sci. 1027, Springer-Verlag, 1995, pp. 162-165.
6. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 5, 1994, pp. 235-282. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in /pub/papers/compgeo.
7. P. Eades, C. Stirk, S. Whitesides, The Techniques of Kolmogorov and Bardzin for Three Dimensional Orthogonal Graph Drawings, TR 95-07, Dept. of Computer Science, University of Newcastle, Australia, 1995. Also to appear in Information Processing Letters.
8. P. Eades, A. Symvonis, S. Whitesides, Two Algorithms for Three Dimensional Orthogonal Graph Drawing, Proc. of Workshop GD '96, Lecture Notes in Comp. Sci. 1190, Springer-Verlag, 1996, pp. 139-154.
9. A. Garg and R. Tamassia, GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D, Proc. of Workshop GD '96, Lecture Notes in Comp. Sci. 1190, Springer-Verlag, 1996, pp. 193-200.
10. Goos Kant, Drawing Planar Graphs Using the Canonical Ordering, Algorithmica, volo 16, no. 1, 1996, pp. 4-32.
11. A. N. Kolmogorov and Y. M. Bardzin, About Realization of Sets in 3-dimensional Space, Problems in Cybernetics, 1967, pp. 261-268.
12. J. MacKinley, G. Robertson, S. Card, Cone Trees: Animated 3d visualizations of hierarchical information, In Proc. of SIGCttI Conf. on Human Factors in Computing, pp. 189-194, 1991.
13. A. Papakostas and I. G. Tollis, Algorithms for Area-Efficient Orthogonal Drawings, Technical Report UTDCS-06-95, The University of Texas at Dallas, 1995.
14. A. Papakostas and I. G. Totlis, Issues in Interactive Orthogonal Graph Drawing, Proc. of Workshop GD '95, Lecture Notes in Comp. Sci, 1027, Springer-Verlag, 1995, pp. 419-430.
15. A. Papakostas and I. G. Tollis, A Pairing Technique for Area-Efficient Orthogonal Drawings, Proc. of Workshop GD '96, Lecture Notes in Comp. Sci. 1190, Springer- Verlag, 1996, pp. 355-370.
16. A. Papakostas, J. Six and I. G. Tollis, Experimental and Theoretical Results in Interactive Graph Drawing, Proc. of Workshop GD '96, Lecture Notes in Comp. Sci. 1190, Springer-Verlag, 1996, pp. 371-386.
17. A. Papakostas and I. G. Tollis, Incremental Orthogonal Graph Drawing in Three Dimensions, Technical Report UTDCS-02-97, The University of Texas at Dallas, 1997. (available through www.utdallas.edu/-tollis)
18. S. Reiss, An engine for the 3D visualization of program information, J. Visual Languages and Computing, vol. 6, no. 3, 1995.
19. Markus Schäffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. 63 (1995) pp. 75-89.
20. R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230-1234.