Dynamic WWW structures in 3D

Journal of Graph Algorithms and Applications

Volumn 4, Issue 3, 2000, Pages 183-191

  Brandes, Ulrik ^a   Kääb, Vanessa ^a   Löh, Andres ^a   Wagner, Dorothea ^a   Willhalm, Thomas ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); INTERACTIVE COMPUTER GRAPHICS;

DYNAMIC WWW; GRAPH ALGORITHMS; GRAPH DRAWING; GRAPH-DRAWING PROBLEM; TECHNICAL DETAILS; WEB-SITES;

DIRECTED GRAPHS;

EID: 0006800370     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00030     Document Type: Conference Paper

References (15)

1. U. Brandes. Layout of Graph Visualizations. PhD thesis, University of Konstanz, 1999. See http://www.ub.uni-konstanz/kops/volltexte/1999/255/.
2. U. Brandes and D.Wagner. A Bayesian paradigm for dynamic graph layout. G. Di Battista, editor. Proc. 5th Intl. Symp. Graph Drawing (GD '97), Lecture Notes in Computer Science vol. 1353, pages 236-247. Springer, 1997.
3. U. Brandes and D. Wagner. Using graph layout to visualize train interconnection data. In this issue.
4. S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In this issue.
5. I. F. Cruz and J. P. Twarog. 3D graph drawing with simulated annealing. F. J. Brandenburg, editor. Proc. 3rd Intl. Symp. Graph Drawing (GD '95), Lecture Notes in Computer Science vol. 1027, pages 162-165. Springer, 1996.
6. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175-198, 1988.
7. P. Eades and J. Marks. Graph drawing contest report. R. Tamassia and I. G. Tollis, editors. Proc. 2nd Intl. Symp. Graph Drawing (GD '94), Lecture Notes in Computer Science vol. 894, pages 143-146. Springer, 1995.
8. P. Eades and J. Marks. Graph-drawing contest report. F. J. Brandenburg, editor. Proc. 3rd Intl. Symp. Graph Drawing (GD '95), Lecture Notes in Computer Science vol. 1027, pages 224-233. Springer, 1996.
9. P. Eades, J. Marks, P. Mutzel, and S. C. North. Graph drawing contest report. S. H. Whitesides, editor. Proc. 6th Intl. Symp. Graph Drawing (GD '98), Lecture Notes in Computer Science vol. 1547, pages 423-435. Springer, 1998.
10. P. Eades, J.Marks, and S. C. North. Graph-drawing contest report. In S. C. North, editor, Proc. 4th Intl. Symp. on Graph Drawing (GD '96), Lecture Notes in Computer Science vol. 1190, pages 129-138. Springer, 1996.
11. P. Eades, J. Marks, and S. C. North. Graph-drawing contest report. G. Di Battista, editor. Proc. 5th Intl. Symp. Graph Drawing (GD '97), Lecture Notes in Computer Science vol. 1353, pages 438-445. Springer, 1997.
12. K. Mehlhorn and S. Näher. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page http://www.mpi-sb.mpg.de/LEDA/.
13. K. Sugiyama and K. Misue. Graph drawing by the magnetic spring model. Journal on Visual Languages and Computing, 6(3):217-231, 1995.
14. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109-125, 1981.
15. R. Webber. Finding the Best Viewpoint for Three-Dimensional Graph Drawings. PhD thesis, University of Newcastle, 1998. See http://www. cs.mu.oz.au/~rwebber/research/thesis/.