Improved force-directed layouts

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

Volumn 1547, Issue , 1999, Pages 364-373

  Gansner, Emden R ^a   North, Stephen C ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957872763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_28     Document Type: Conference Paper

References (29)

1. J. Abello and E. Gansner. Short and smooth polygonal paths. In C. Lucchesi and A. Moura, editors, LATIN'98: Theoretical Informatics, volume 1380 of Lecture Notes in Computer Science, pages 151-162, 1998.
2. F.J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 76-87, 1996.
3. J. Cohen. Drawing graphs to convey proximity: an incremental arrangement method. ACM Transactions on Computer-Human Interaction, 4(11):197-229, 1987.
4. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
5. D. Dobkin, E. Gansner, E. Koutso_os, and S. North. Implementing a general- purpose edge router. In G. DiBattista, editor, Symposium on Graph Drawing GD'97, volume 1353 of Lecture Notes in Computer Science, pages 262-271, 1997.
6. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
7. P. Eades and X. Lin. Spring algorithms and symmetry. In COCOON'97, volume 1276 of Lecture Notes in Computer Science, pages 202-211, 1997.
8. U. Fossmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 254-266, 1996.
9. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I.G. Tollis, editors, Symposium on Graph Drawing GD'94, volume 894 of Lecture Notes in Computer Science, pages 388-403, 1995.
10. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991. also as Technical Report UIUCDCS-R-90-1609, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1990.
11. E.R. Gansner, E. Koutsofios, S.C. North, and K.P. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, March 1993.
12. E.R. Gansner, S.C. North, and K.P. Vo. Dag - a program that draws directed graphs. Software - Practice and Experience, 18(11):1047-1062, 1988.
13. W. He and K. Marriott. Constrained graph layout. In S.C. North, editor, Symposium on Graph Drawing GD'96, volume 1190 of Lecture Notes in Computer Science, pages 217-232, 1997.
14. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
15. T. Kamps, J. Kleinz, and J. Read. Constraint-based spring-model algorithm for graph layout. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 349-360, 1996.
16. E. Koutsofios and S. North. Intertool connections. In B. Krishnamurthy, editor, Practical Reusable UNIX Software, chapter 11, pages 300-315. JohnWiley & Sons, New York, 1995.
17. J. Kruskal and J. Seery. Designing network diagrams. In Proc. First General Conf. on Social Graphics, pages 22-50, 1980.
18. X. Lin. Analysis of Algorithms for Drawing Graphs. PhD thesis, Department of Computer Science, University of Queensland, 1992.
19. R. Lipton, S. North, and J. Sandberg. A method for drawing graphs. In Proc. ACM Symp. on Computational Geometry, pages 153-160, 1985.
20. K. Lyons. Cluster busting in anchored graph drawing. In Proceedings of the 1992 CAS Conference, pages 7-16, 1992.
21. K. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1):1-24, 1998.
22. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1994.
23. M.-A. Storey and H. Muller. Graph layout adjustment strategies. In F.J. Bran- denburg, editor, Symposium on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 487-99, 1996.
24. K. Sugiyama and K. Misue. A simple and unified method for drawing graphs: Magnetic-spring algorithm. In R. Tamassia and I.G. Tollis, editors, Symposium on Graph Drawing GD'94, volume 894 of Lecture Notes in Computer Science, pages 364-375, 1995.
25. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC- 11(2):109-125, 1981.
26. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421-444, 1987.
27. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and read- ability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, SMC- 18(1):61-79, 1988.
28. X. Wang and I. Miyamoto. Generating customized layouts. In F.J. Brandenburg, editor, Symposium on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 504-515, 1996.
29. G. Wills. Nicheworks - interactive visualization of very large graphs. In G. Di- Battista, editor, Symposium on Graph Drawing GD'97, volume 1353 of Lecture Notes in Computer Science, pages 403-414, 1997.