A Bayesian Paradigm for Dynamic Graph Layout

Brandes, Ulrik; Wagner, Dorothea

A Bayesian Paradigm for Dynamic Graph Layout

Dateien

bw_bpdgl_97.pdfGröße: 228.06 KBDownloads: 439

Datum

2005

Autor:innen

Brandes, Ulrik

Wagner, Dorothea

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

DIBATTISTA, Giuseppe, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 236-247. Lecture Notes in Computer Science. 1353. ISBN 978-3-540-63938-1. Available under: doi: 10.1007/3-540-63938-1_66

Zusammenfassung

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].

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

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

BibTex

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

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5767">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5767/1/bw_bpdgl_97.pdf"/>
    <dc:format>application/pdf</dc:format>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:55Z</dc:date>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5767/1/bw_bpdgl_97.pdf"/>
    <dcterms:title>A Bayesian Paradigm for Dynamic Graph Layout</dcterms:title>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dcterms:issued>2005-07-29</dcterms:issued>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5767"/>
    <dc:language>eng</dc:language>
    <dcterms:bibliographicCitation>First publ. in: Lecture notes in computer science, No. 1353 (1997), pp. 236-247</dcterms:bibliographicCitation>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:55Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">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.&lt;br /&gt;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].</dcterms:abstract>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja