Fast Layout Methods for Timetable Graphs
Brandes, Ulrik and Shubina, Galina and Tamassia, Roberto and Wagner, Dorothea (2001) Fast Layout Methods for Timetable Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 127-138 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_12).
Full text not available from this repository.
Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small angles and overlaps, not all edges should be represented by geodesics (straight lines or great circles). A previously introduced algorithm represents a subset of the edges by Bézier curves, and places control points of these curves using a force-directed approach . While the results are of very good quality, the running times make the approach impractical for interactive systems. In this paper, we present a fast layout algorithm using an entirely different approach to edge routing, based on directions of control segments rather than positions of control points. We reveal an interesting theoretical connection with Tutte's barycentric layout method , and our computational studies show that this new approach yields satisfactory layouts even for huge timetable graphs within seconds.
Repository Staff Only: item control page