Fast layout methods for timetable graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 127-138

  Brandes, Ulrik ^a   Shubina, Galina ^b   Tamassia, Roberto ^b   Wagner, Dorothea ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

COMPUTATIONAL STUDIES; CONTROL SEGMENTS; FORCE-DIRECTED; INTERACTIVE SYSTEM; LAYOUT ALGORITHMS; LAYOUT METHODS; TRANSPORTATION NETWORK; VERTEX COORDINATES;

SCHEDULING;

EID: 33645628540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_12     Document Type: Conference Paper

References (19)

1. J. Abello and E.R. Gansner. Short and smooth polygonal paths. Proc. LATIN '98, Springer LNCS 1380, pp. 151-162, 1998.
2. R.A. Becker, S.G. Eick, and A.R. Wilks. Visualizing network data. IEEE Transactions on Visualization and Graphics, 1(1):16-28, 1995.
3. P. Bfiezier. Numerical Control. John Wiley and Sons, 1972.
4. U. Brandes, G. Shubina, and R. Tamassia. Improving angular resolution in visualizations of geographic networks. Data Visualization 2000. Proc. VisSym '00, pp. 23-32. Springer, 2000.
5. U. Brandes and D. Wagner. Using graph layout to visualize train interconnection data. Journal of Graph Algorithms and Applications, 2000. To appear.
6. R.L. Brooks, C.A.B. Smith, A.H. Stone, and W.T. Tutte. The dissection of rectangles into squares. Duke Mathematical Journal, 7:312-340, 1940.
7. C.C. Cheng, C.A. Duncan, M.T. Goodrich, and S.G. Kobourov. Drawing planar graphs with circular arcs. Proc. GD '99, Springer LNCS 1731, pp. 117-126, 1999.
8. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
9. D.P. Dobkin, E.R. Gansner, E. Koutsofios, and S.C. North. Implementing a general- purpose edge router. Proc. GD '97, Springer LNCS 1353, pp. 262-271, 1997.
10. E.R. Gansner and S.C. North. Improved force-directed layouts. Proc. GD '98, Springer LNCS 1547, pp. 364-373, 1998.
11. E.R. Gansner, S.C. North, and K.-P. Vo. DAG -A program that draws directed graphs. Software|Practice and Experience, 17(1):1047-1062, 1988.
12. M.T. Goodrich and C.G. Wagner. A framework for drawing planar graphs with curves and polylines. Proc. GD '98, Springer LNCS 1547, pp. 153-166, 1998.
13. C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. Proc. GD '98, Springer LNCS 1547, pp. 167-182, 1998.
14. A. Liebers, D. Wagner, and K. Weihe. On the hardness of recognizing bundels in time table graphs. Proc. WG '99, Springer LNCS 1665, pp. 325-337, 1999.
15. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
16. T. Munzner, E. Hofiman, K. Clafiy, and B. Fenner. Visualizing the global topology of the MBone. Proc. IEEE InfoVis '96, pp. 85-92, 1996.
17. F. Schulz, D. Wagner, and K. Weihe. Dijkstra's algorithm on-line: An empirical case study from public railroad transport. Proc. WAE '99, Springer LNCS 1668, pp. 110-123, 1990.
18. W.T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, Third Series, 13:743-768, 1963.
19. K. Weihe. Covering trains by stations or the power of data reduction. Electronic Proc. ALEX '98, pp. 1-8, 1998. http://rtm.science.unitn.it/alex98/proceedings.html.