Using Graph Layout to Visualize Train Interconnection Data

Brandes, Ulrik; Wagner, Dorothea

Using Graph Layout to Visualize Train Interconnection Data

Files

preprint_062.pdf(2.33 MB)

Date

1998

Authors

Brandes, Ulrik

Wagner, Dorothea

Series

Konstanzer Schriften in Mathematik und Informatik; 62

Publication type

Preprint

Abstract

We are concerned with the problem of visualizing interconnections in railroad systems. The real-world systems we have to deal with contain connections of thousands of trains. To visualize such a system from a given set of time tables a so-called train graph is used. It contains a vertex for each station met by any train, and one edge between every pair of vertices connected by some train running from one station to the other without halting in between.

In visualizations of train graphs, positions of vertices are predetermined, since each station has a given geographical location. If all edges are represented by straight-lines, the result is visual clutter with many overlaps and small angles between pairs of lines. We here present a non-uniform approach using different representations for edges of distinct meaning in the exploration of the data. Only edges of certain type are represented by straight-lines, whereas so-called transitive edges are rendered using Bezier curves. The layout problem then consists of placing control points for these curves. We transform it into a graph layout problem and exploit the generality of random field layout models for its solution.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

BRANDES, Ulrik, Dorothea WAGNER, 1998. Using Graph Layout to Visualize Train Interconnection Data

BibTex

@unpublished{Brandes1998Using-6136,
  year={1998},
  title={Using Graph Layout to Visualize Train Interconnection Data},
  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/6136">
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dcterms:abstract xml:lang="eng">We are concerned with the problem of visualizing interconnections in railroad systems. The real-world systems we have to deal with contain connections of thousands of trains. To visualize such a system from a given set of time tables a so-called train graph is used. It contains a vertex for each station met by any train, and one edge between every pair of vertices connected by some train running from one station to the other without halting in between.&lt;br /&gt;&lt;br /&gt;In visualizations of train graphs, positions of vertices are predetermined, since each station has a given geographical location. If all edges are represented by straight-lines, the result is visual clutter with many overlaps and small angles between pairs of lines. We here present a non-uniform approach using different representations for edges of distinct meaning in the exploration of the data. Only edges of certain type are represented by straight-lines, whereas so-called transitive edges are rendered using Bezier curves. The layout problem then consists of placing control points for these curves. We transform it into a graph layout problem and exploit the generality of random field layout models for its solution.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6136/1/preprint_062.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:45Z</dcterms:available>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6136"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>1998</dcterms:issued>
    <dc:format>application/pdf</dc:format>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:language>eng</dc:language>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6136/1/preprint_062.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:45Z</dc:date>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <dcterms:title>Using Graph Layout to Visualize Train Interconnection Data</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

No