Dynamic grid embedding with few bends and changes

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

Volumn 1533 LNCS, Issue , 1998, Pages 89-99

  Brandes, Ulrik ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; DRAWING (GRAPHICS); EMBEDDINGS;

DYNAMIC GRAPH; DYNAMIC GRID; LAYOUT QUALITY; MINIMUM COST FLOW PROBLEM; OPTIMAL LAYOUT; ORTHOGONAL GRAPHS; VERTEX DEGREE; VERTICAL STRAIGHT LINES;

GRAPH THEORY;

EID: 84867463237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_11     Document Type: Conference Paper

References (25)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows. Prentice Hall, 1993.
2. Therese C. Biedl. New lower bounds for orthogonal graph drawings. In Proc. Graph Drawing '95, pages 28-39. Springer, LNCS vol. 1027, 1996.
3. Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, and Luca Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In Proc. Graph Drawing '97, pages 303-308. Springer, LNCS vol. 1353, 1997.
4. Therese C. Biedl and Goos Kant. A better heuristic for orthogonal graph drawing. In Proc. 2nd European Symposium on Algorithms, pages 24-33. Springer, LNCS vol. 855, 1994.
5. Therese C. Biedl and Michael Kaufmann. Area-efficient static and incremental graph drawings. In Proc. 5th European Symposium on Algorithms, pages 37-52. Springer, LNCS vol. 1284, 1997.
6. Therese C. Biedl, Brendan P. Madden, and Ioannis G. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In Proc. Graph Drawing '97, pages 391-402. Springer, LNCS vol. 1353, 1997.
7. Karl-Friedrich Böhringer and Frances Newbery Paulisch. Using constraints to achieve stability in automatic graph layout algorithms. In C HI'90 P roceedings, pages 43-51. ACM, The Association for Computing Machinery, 1990.
8. Ulrik Brandes and Dorothea Wagner. A Bayesian paradigm for dynamic graph layout. In Proc. Graph Drawing '97, pages 237-247. Springer, LNCS vol. 1353, 1997.
9. Ulrik Brandes and Dorothea Wagner. Random field models for graph layout. Konstanzer Schriften in Mathematik und Informatik 33, Universität Konstanz, 1997.
10. Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, and P. Bertolazzi. A framework for dynamic graph drawing. In Proc. 8th Symposium on Computational Geometry, pages 261-270. ACM, The Association for Computing Machinery, 1992
11. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Computational Geometry, 4:235-282, 1994.
12. Giuseppe Di Battista and Luca Vismara. Angles of planar triangular graphs. SIAM J. Discrete Math.,9(3):349-359, 1996.
13. Peter Eades, Wei Lai, Kazuo Misue, and Kozo Sugiyama. Preserving the mental map of a diagram. Proc. Compugraphics '91,9:24-33, 1991.
14. Ulrich Fößmeier and Michael Kaufmann. Drawing High Degree Graphs with Low Bend Numbers. In Proc. Graph Drawing '95, pages 254-266. Springer, LNCS vol. 1027, 1996.
15. Ashim Garg. On drawing angle graphs. In Proc. Graph Drawing '94, pages 84-95. Springer, LNCS vol. 894, 1995.
16. Ashim Garg and Roberto Tamassia. On the computational complexity of upward and rectilinear planarity testing. In Proc. Graph Drawing '94, pages 286-297. Springer, LNCS vol. 894, 1995.
17. Ashim Garg and Roberto Tamassia. An new minimum cost flow algorithm with applications to graph drawing. In Proc. Graph Drawing '96, pages 201-216. Springer, LNCS vol. 1190, 1997.
18. Seth Malitz and Achilleas Papakostas. On the angular resolution of planar graphs. SIAM J. Discrete Math.,7(2):172-183, 1994.
19. Stephen North. Incremental layout in DynaDAG. In Proc. Graph Drawing '95, pages 409-418. Springer, LNCS vol. 1027, 1996.
20. Achilleas Papakostas and Ioannis G. Tollis. Improved algorithms and bounds for orthogonal drawings. In Proc. Graph Drawing '94, pages 40-51. Springer, LNCS vol. 894, 1995.
21. Achilleas Papakostas and Ioannis G. Tollis. Issues in interactive orthogonal graph drawing. In Proc. Graph Drawing '95, pages 419-430. Springer, LNCS vol. 1027, 1996.
22. Helen Purchase. Which aesthetic has the greatest effect on human understanding? In Proc. Graph Drawing '97, pages 248-261. Springer, LNCS vol. 1353, 1997.
23. Roberto Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput.,16(3):421-444, 1987.
24. Roberto Tamassia, Giuseppe DiBattista, and Carlo Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61-79, 1988.
25. Gopalakrishnan Vijayan. Geometry of planar graphs with angles. In Proc. 2nd Symposium on Computational Geometry, pages 116-124. ACM, The Association of Computing Machinery, 1986.