DAG—a program that draws directed graphs
Software—Practice & Experience
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
IEEE Transactions on Visualization and Computer Graphics
Short and Smooth Polygonal Paths
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Using Graph Layout to Visualize Train Interconnection Data
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On the Hardness of Recognizing Bundles in Time Table Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Visualizing the global topology of the MBone
INFOVIS '96 Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96)
Curvilinear graph drawing using the force-directed method
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
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 [5]. 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 [18], and our computational studies show that this new approach yields satisfactory layouts even for huge timetable graphs within seconds.