A bayesian paradigm for dynamic graph layout

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

Volumn 1353, Issue , 1997, Pages 236-247

  Brandes, Ulrik ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY;

BAYESIAN DECISION THEORY; BAYESIAN PARADIGM; DYNAMIC GRAPH LAYOUT; DYNAMIC LAYOUT; ORTHOGONAL LAYOUT; PLANE GRAPHS; RANDOM FIELD MODEL; USER INTERACTION;

DRAWING (GRAPHICS);

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

References (16)

1. Karl-Friedrich Böhringer and Frances Newbery Paulisch. Using constraints to achieve stability in automatic graph layout algorithms. In CHI'90 Proceedings, pages 43-51. ACM, The Association for Computing Machinery, New York, 1990.
2. Ulrik Brandes and Dorothea Wagner. Random field models for graph layout. Konstanzer Schriften in Mathematik und Informatik 33, Universität Konstanz, 1997.
3. Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, and P. Bertolazz L A Framework for Dynamic Graph Drawing. In Proc. of 8th Annual Computational Geometry, 6/92, Berlin, Germany, pages 261-270. ACM, The Association for Computing Machinery, New York, 1992.
4. Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planarst-digraphs. SIAM J. Comput., 24(5):970-1001, 1995.
5. R. Chellappa and A.K. Jain. Markov Random Fields: Theory and Applications. Academic Press, 1993.
6. Ron Davidson and David Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
7. Peter Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
8. Peter Eades, W. Lai, Kazuo Misue, and Kozo Sugiyama. Preserving the mental map of a diagram. Proceedings of Compugraphics, 9:24-33, 1991
9. Stuart Geman and Donald Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):721-741, 1984.
10. Stuart Geman and Donald E. McClure. Bayesian image analysis: an application to single photon emission tomography. Proc. American Statistical Association, Statistical Computing Section, pages 12-18, 1985.
11. Xavier Guyon. Random Fields on a Network. Springer, 1994.
12. Kelly A. Lyons. Cluster busting in anchored graph drawing. In Proceedings of the '92 CAS Conferenee/CASCON'92, Toronto, 1992, pages 7-17, 1992.
13. Stephen North. Incremental Layout in DynaDAG. Proceedings of GD'95, pages 409-418. Springer-Verlag, Lecture Notes in Computer Science, vol. 1027, 1996.
14. Achilleas Papakostas and Ioannis G. Tollis. Issues in Interactive Orthogonal Graph Drawing. Proceedings of GD'95, pages 419-430. Springer-Verlag, Lecture Notes in Computer Science, vol. 1027, 1996.
15. Roberto Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.
16. Gerhard Winkler. Image Analysis, Random Fields and Dynamic Monte Carlo Methods, volume 27 of Applications of Mathematics. Springer, 1995.