Using Graph Layout to Visualize Train Interconnection Data

Brandes, Ulrik and Wagner, Dorothea (1998) Using Graph Layout to Visualize Train Interconnection Data. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 44-56 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_4).

Full text not available from this repository.

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

Item Type:Conference Paper
Additional Information:10.1007/3-540-37623-2_4
Classifications:G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.560 Geometry
ID Code:242

Repository Staff Only: item control page

References

Julian Besag. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society B, 48(3):259-302,1986.

Pierre Bézier. Numerical Control. John Wiley, 1972.

U. Brandes, P. Kenis, J. Raab, V. Schneider, and D. Wagner. Explorations into the visualization of policy networks. To appear in Journal of Theoretical Politics.

U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. Proc. of Graph Drawing '97. Springer, LNCS, vol. 1353, pages 236-247, 1997.

U. Brandes and D. 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 simmulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.

P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.

Toshiyuki Masui. Evolutionary learning of graph layout constraints from examples. Proc. of the ACM Symposium on User Interface Software and Technology. ACM Press, pages 103-108, 1994.

X. Mendonca and P. Eades. Learning aesthetics for visualization. In Anias do XX Seminario Integrado de Software e Hardware, pages 76-88, Florianopolis, SC (Brazil), 1993.

M. Pelillo and E.R. Hancock (eds.). Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer, LNCS, vol. 1223, 1997.

G. Winkler. Image Analysis, Random Fields and Dynamic Monte Carlo Methods, vol. 27 of Applications of Mathematics. Springer, 1995.