A bayesian paradigm for dynamic graph layout
Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. they build a mental map [ELMS91]. To retain this map at least partially, consecutive layouts of similar graphs should not differ significantly. Still, each of these layouts should adhere to constraints and criteria that have been specified to improve meaning and readability of a drawing.
In [BW97], we introduced random field models for graph layout. As a major advantage of this formulation, many different layout models can be represented uniformly by random variables. This uniformity enables us to now present a framework for dynamic layout of arbitrary random field models. Our approach is based on Bayesian decision theory and formalizes common sense procedures. Example applications of our framework are dynamic versions of two well-known layout models: Eades' spring embedder [Ead84], and Tamassia's bend-minimum orthogonal layout model for plane graphs [Tam87].
- [BP90]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.Google Scholar
- [BW97]Ulrik Brandes and Dorothea Wagner. Random field models for graph layout. Konstanzer Schriften in Mathematik und Informatik 33, Universität Konstanz, 1997.Google Scholar
- [CDT92]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, and P. Bertolazzi. 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.Google Scholar
- [CJ93]R. Chellappa and A.K. Jain. Markov Random Fields: Theory and Applications. Academic Press, 1993.Google Scholar
- [Ead84]Peter Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.Google Scholar
- [ELMS91]Peter Eades, W. Lai, Kazuo Misue, and Kozo Sugiyama. Preserving the mental map of a diagram. Proceedings of Compugraphics, 9:24–33, 1991.Google Scholar
- [GG84]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.Google Scholar
- [GM85]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.Google Scholar
- [Guy94]Xavier Guyon. Random Fields on a Network. Springer, 1994.Google Scholar
- [Lyo92]Kelly A. Lyons. Cluster busting in anchored graph drawing. In Proceedings of the '92 CAS Conference/CASCON'92, Toronto, 1992, pages 7–17, 1992.Google Scholar
- [Nor96]Stephen North. Incremental Layout in DynaDAG. Proceedings of GD'95, pages 409–418. Springer-Verlag, Lecture Notes in Computer Science, vol. 1027, 1996.Google Scholar
- [PT96]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.Google Scholar
- [Win95]Gerhard Winkler. Image Analysis, Random Fields and Dynamic Monte Carlo Methods, volume 27 of Applications of Mathematics. Springer, 1995.Google Scholar