...
- 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.
- 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.
- Eades, P. A heuristic for graph drawing Stanton. Ralph G. (Ed.). Congressus numerantium. Winnipeg: Utilitas Mathematica.
- Young, P. (1996) Software Visualization. http://vrg.dur.ac.uk/misc/PeterYoung/pages/work/documents/lit-survey/soft-vis/
- Forbes, R.(1987) Heuristic acceleration of force-directed placement. In Proceedings of 24th ACM/IEEE Conference on Design Automation Conference, 735-740.
- 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.
- Jones, C. Graph Drawing webpagehttp://replay.waybackmachine.org/20060901121831/http://orcs.bus.okstate.edu/jones98/drawing.htm
- 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. http://www.cs.panam.edu/~rfowler/papers/1994_kumar_fowler_A_Spring_UTPACSTR.pdf
See Also
| Wiki Markup |
|---|
{incoming-links |
:spaces=}
{incoming-links} |