Using Graph Layout to Visualize Train Interconnection Data

Cite This

Files in this item

Checksum: MD5:be5f3ab4e079d472f001359a3afe33fa

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

@unpublished{Brandes1998Using-6136, title={Using Graph Layout to Visualize Train Interconnection Data}, year={1998}, author={Brandes, Ulrik and Wagner, Dorothea} }

Using Graph Layout to Visualize Train Interconnection Data Wagner, Dorothea Wagner, Dorothea 2011-03-24T16:09:45Z Brandes, Ulrik 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.<br /><br />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. 1998 application/pdf eng terms-of-use 2011-03-24T16:09:45Z Brandes, Ulrik

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

preprint_062.pdf 325

This item appears in the following Collection(s)

Search KOPS


My Account