Child pages
  • Force Directed with Annotation (prefuse beta)

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migration of unmigrated content due to installation of a new plugin


  1. Battista, G. , Eades, P., Tamassia, R., and Tollis, I.G. (1994) Algorithms for drawing graphs: An annotated bibliography. Computational Geometry: Theory and Applications, 4(5), 235-282.
  2. Dobkin, D. P., Hausner, A., Gansner, E. R., & North, S. C.(1999) Clustering force-directed graph layouts. In Proceedings of the 15th Annual Symposium on Computational Geometry, 425-426.
  3. Eades, P. A heuristic for graph drawing Stanton. Ralph G. (Ed.). Congressus numerantium. Winnipeg: Utilitas Mathematica.
  4. Young, P. (1996) Software Visualization.
  5. Forbes, R.(1987) Heuristic acceleration of force-directed placement. In Proceedings of 24th ACM/IEEE Conference on Design Automation Conference, 735-740.
  6. Huang, M. L., Eades, P., & Wang, J. (1998) On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing, 9(6), 623-645.
  7. Jones, C. Graph Drawing webpage
  8. Kumar, A. & Fowler, R.H. (1996) A Spring Modeling Algorithm to Position Nodes of an undirected Graph in Three Dimensions. Technical Report Department of Computer Science, University of Texas - Pan American.
See Also

{:spaces=} {incoming-links}
Wiki Markup
Incoming Links