Using Graph Layout to Visualize Train Interconnection Data
 Ulrik Brandes,
 Dorothea Wagner
 … show all 2 hide
Abstract
We are concerned with the problem of visualizing interconnections in railroad systems. The realworld 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 socalled 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 straightlines, the result is visual clutter with many overlaps and small angles between pairs of lines. We here present a nonuniform approach using different representations for edges of distinct meaning in the exploration of the data. Only edges of certain type are represented by straightlines, whereas socalled transitive edges are rendered using Bézier 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.
 Julian Besag. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society B, 48(3):259–3021986.
 Pierre Bézier. Numerical Control. John Wiley, 1972.
 Ulrik Brandes, Patrick Kenis, Jörg Raab, Volker Schneider, and Dorothea Wagner. Explorations into the visualization of policy networks. To appear in Journal of Theoretical Politics.
 Ulrik Brandes and Dorothea Wagner. A Bayesian paradigm for dynamic graph layout. Proceedings of Graph Drawing’ 97. Springer, Lecture Notes in Computer Science, vol. 1353, pages 236–247, 1997.
 Ulrik Brandes and Dorothea Wagner. Random field models for graph layout. Konstanzer Schriften in Mathematik und Informatik 33, University of Konstanz, 1997.
 Ron Davidson and David Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301–331, 1996. CrossRef
 Peter Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.
 Toshiyuki Masui. Evolutionary learning of graph layout constraints from examples. Proceedings of the ACM Symposium on User Interface Software and Technology. ACM Press, pages 103–108, 1994.
 Xavier MendonÇa and Peter Eades. Learning aesthetics for visualization. Anais do XX Seminário Integrado de Software e Hardware, Florianópolis, Brazil, pages 76–88, 1993.
 Marcello Pelillo and Edwin R. Hancock (eds.). Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer, Lecture Notes in Computer Science, vol. 1223, 1997.
 Gerhard Winkler. Image Analysis, Random Fields and Dynamic Monte Carlo Methods, vol. 27 of Applications of Mathematics. Springer, 1995.
 Title
 Using Graph Layout to Visualize Train Interconnection Data
 Book Title
 Graph Drawing
 Book Subtitle
 6th International Symposium, GD’ 98 Montréal, Canada, August 13–15, 1998 Proceedings
 Pages
 pp 4456
 Copyright
 1998
 DOI
 10.1007/3540376232_4
 Print ISBN
 9783540654735
 Online ISBN
 9783540376231
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1547
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Sue H. Whitesides ^{(4)}
 Editor Affiliations

 4. School of Computer Science, McGill University
 Authors

 Ulrik Brandes ^{(5)}
 Dorothea Wagner ^{(5)}
 Author Affiliations

 5. Faculty of Mathematics and Computer Science, University of Konstanz, Fach D 188, D78457, Konstanz, Germany
Continue reading...
To view the rest of this content please follow the download PDF link above.