Publikation: Using Graph Layout to Visualize Train Interconnection Data
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the connection structure represented in a so-called train graph. 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.
Positions of vertices in a train graph visualization are given by the geographical location of the corresponding station. If all edges are represented by straight-lines, the result is visual clutter with many overlaps and small angles between pairs of lines. We therefore present a non-uniform approach using different representations for edges of distinct meaning in the exploration of the data. Some edges are represented by curved lines, such that the layout problem consists of placing control points for these curves. We transform it into a graph layout problem and exploit the generality of the random field layout model formulation for its solution.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
BRANDES, Ulrik, Dorothea WAGNER, 2000. Using Graph Layout to Visualize Train Interconnection Data. In: Journal of Graph Algorithms and Applications. 2000, 4(3), pp. 135-155. Available under: doi: 10.1007/3-540-37623-2_4BibTex
@article{Brandes2000Using-5825, year={2000}, doi={10.1007/3-540-37623-2_4}, title={Using Graph Layout to Visualize Train Interconnection Data}, number={3}, volume={4}, journal={Journal of Graph Algorithms and Applications}, pages={135--155}, 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/5825"> <dcterms:issued>2000</dcterms:issued> <dc:format>application/pdf</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:24Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Using Graph Layout to Visualize Train Interconnection Data</dcterms:title> <dc:creator>Wagner, Dorothea</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5825/1/interconnection.pdf"/> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5825"/> <dc:creator>Brandes, Ulrik</dc:creator> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dcterms:bibliographicCitation>First publ. in: Journal of Graph Algorithms and Applications 4 (2000), 3, pp. 135-155</dcterms:bibliographicCitation> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:24Z</dc:date> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5825/1/interconnection.pdf"/> <dcterms:abstract xml:lang="eng">We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the connection structure represented in a so-called train graph. 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.<br />Positions of vertices in a train graph visualization are given by the geographical location of the corresponding station. If all edges are represented by straight-lines, the result is visual clutter with many overlaps and small angles between pairs of lines. We therefore present a non-uniform approach using different representations for edges of distinct meaning in the exploration of the data. Some edges are represented by curved lines, such that the layout problem consists of placing control points for these curves. We transform it into a graph layout problem and exploit the generality of the random field layout model formulation for its solution.</dcterms:abstract> <dc:contributor>Wagner, Dorothea</dc:contributor> </rdf:Description> </rdf:RDF>