Curvilinear graph drawing using the force-directed method

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 448-453

  Finkel, Benjamin ^a   Tamassia, Roberto ^b  

^a MIT LINCOLN LABORATORY   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANGULAR RESOLUTION; CURVED LINES; EDGE CROSSINGS; FORCE-DIRECTED GRAPH DRAWING ALGORITHMS; CONTROL POINT; EDGE CROSSING; FORCE-DIRECTED METHOD; GEM ALGORITHM; GRAPH DRAWING;

ALGORITHMS; COMPUTER SCIENCE; EMBEDDED SYSTEMS; GRAPH THEORY; DRAWING (GRAPHICS);

DRAWING (GRAPHICS); DIRECTED GRAPHS;

EID: 24144482363     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. JDSL: the data structures library in Java, http://jdsl.org.
2. VGJ: Visualizing graphs with Java. http://www.eng.auburn.edu/department/ cse/research/graph_drawing/graph_drawing.html.
3. F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In Graph Drawing (Proc. GD 1995), LNCS 1027, pp. 76-87. 1996.
4. U. Brandes, G. Shubina, and R. Tamassia. Improving angular resolution in visualizations of geographic networks. In Proc. Joint Eurographics - IEEE TCVG Symposium on Visualization (VisSym '00), pp. 23-32, 2000.
5. U. Brandes, G. Shubina, R. Tamassia, and D. Wagner. Fast layout methods for timetable graphs. In Graph Drawing (Proc. GD 2000), LNCS 1984, pp. 127-138, 2001.
6. U. Brandes and D. Wagner. Using graph layout to visualize train interconnection data. In Graph Drawing (Proc. GD 1998), LNCS 1547, pp. 44-56, 1998.
7. C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Drawing planar graphs with circular arcs. In Graph Drawing (Proc. GD 1999), LNCS 1731, pp. 117-126, 1999.
8. R. Davidson and D. Harel. Drawing graphics nicely using simulated annealing. ACM Trans. Graph., 15(4):301-331, 1996.
9. D. P. Dobkin, E. R. Gansner, E. Koutsofios, and S. C. North. Implementing a general-purpose edge router. In Graph Drawing (Proc. GD 1997), LNCS 1353, pp. 262-271, 1997.
10. P. Eades. A heuristic for graph drawing. Congr. Numer., 42:149-160, 1984.
11. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In Graph Drawing (Proc. GD 1994), LNCS 894, pp. 388-403, 1995.
12. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw. - Pract. Exp., 21(11):1129-1164, 1991.
13. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A fast multi-dimensional algorithm for drawing large graphs. Graph Drawing (Proc. GD 2000), LNCS 1984, pp. 211-221, 2000.
14. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19:214-230, 1993.
15. E. R. Gansner, S. C. North, and K. P. Vo. DAG - A program that draws directed graphs. Softw. - Pract. Exp., 18(11):1047-1062, 1988.
16. A. Garg and R. Tamassia. GIOTTO3D: A system for visualizing hierarchical structures in 3D. In Graph Drawing (Proc. GD 1996), LNCS 1190, pp. 193-200, 1997.
17. M. T. Goodrich and C. G. Wagner. A framework for drawing planar graphs with curves and polylines. In Graph Drawing (Proc. GD 1998), LNCS 1547, pp. 153-166, 1998.
18. C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. In Graph Drawing (Proc. GD 1998), LNCS 1547, pp. 167-182, 1998.
19. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. Graph Drawing (Proc. GD 2002), LNCS 2528, pp. 207-219, 2002.
20. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inform. Process. Lett., 31:7-15, 1989.
21. T. Munzner, E. Hoffman, K. Claffy, and B. Fenner. Visualizing the global topology of the MBone. In Proc. IEEE Symp. on Information Visualization, pp. 85-92, 1996.