A Bayesian Paradigma for Dynamic Graph Layout

Brandes, Ulrik; Wagner, Dorothea

A Bayesian Paradigma for Dynamic Graph Layout

Dateien

preprint_040.pdfGröße: 249.29 KBDownloads: 413

Datum

1997

Autor:innen

Brandes, Ulrik

Wagner, Dorothea

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Preprint

Publikationsstatus

Published

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

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.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

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

BibTex

@unpublished{Brandes1997Bayes-6350,
  year={1997},
  title={A Bayesian Paradigma for Dynamic Graph Layout},
  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/6350">
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dcterms:title>A Bayesian Paradigma for Dynamic Graph Layout</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6350/1/preprint_040.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:39Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <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. 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;&lt;br /&gt;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.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:39Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6350/1/preprint_040.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dc:format>application/pdf</dc:format>
    <dcterms:issued>1997</dcterms:issued>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6350"/>
    <dc:rights>terms-of-use</dc:rights>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein