Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können am Montag, 6.2. und Dienstag, 7.2. keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted on Monday, Feb. 6 and Tuesday, Feb. 7.)

A Bayesian Paradigm for Dynamic Graph Layout

Cite This

Files in this item

Checksum: MD5:c850061a17b55d0627da35be09e72b4d

BRANDES, Ulrik, Dorothea WAGNER, 2005. A Bayesian Paradigm for Dynamic Graph Layout. In: DIBATTISTA, Giuseppe, ed.. Graph Drawing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 236-247. ISBN 978-3-540-63938-1. Available under: doi: 10.1007/3-540-63938-1_66

@inproceedings{Brandes2005-07-29Bayes-5767, title={A Bayesian Paradigm for Dynamic Graph Layout}, year={2005}, doi={10.1007/3-540-63938-1_66}, number={1353}, isbn={978-3-540-63938-1}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing}, pages={236--247}, editor={DiBattista, Giuseppe}, author={Brandes, Ulrik and Wagner, Dorothea} }

2005-07-29 2011-03-24T15:59:55Z 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.<br />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]. A Bayesian Paradigm for Dynamic Graph Layout Attribution-NonCommercial-NoDerivs 2.0 Generic application/pdf Brandes, Ulrik Wagner, Dorothea Brandes, Ulrik Wagner, Dorothea eng 2011-03-24T15:59:55Z First publ. in: Lecture notes in computer science, No. 1353 (1997), pp. 236-247

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

bw_bpdgl_97.pdf 427

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivs 2.0 Generic Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 2.0 Generic

Search KOPS


My Account