A Bayesian Paradigma for Dynamic Graph Layout

Cite This

Files in this item

Checksum: MD5:d4e6e88b6726762dbc3b2c91828f24c0

BRANDES, Ulrik, Dorothea WAGNER, 1997. A Bayesian Paradigma for Dynamic Graph Layout

@unpublished{Brandes1997Bayes-6350, title={A Bayesian Paradigma for Dynamic Graph Layout}, year={1997}, author={Brandes, Ulrik and Wagner, Dorothea} }

terms-of-use A Bayesian Paradigma for Dynamic Graph Layout Brandes, Ulrik application/pdf Wagner, Dorothea eng 2011-03-24T16:11:39Z 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. 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.<br /><br />We recently introduced random field models for graph layout. As a major advantage of this formulation, many different layout models can be represented uniformly by a random variable. 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, and Tamassia's bend-minimum orthogonal layout model for plane graphs. 1997 Brandes, Ulrik Wagner, Dorothea 2011-03-24T16:11:39Z

Downloads since Oct 1, 2014 (Information about access statistics)

preprint_040.pdf 604

This item appears in the following Collection(s)

Search KOPS


Browse

My Account