Next: Kamada-Kawai Model
Up: Graph layout algorithms
Previous: Force-Directed Layout
The force-directed model offers a lot of potential in its ability to find an optimum layout for sets of vertices and edges, that achieves the aesthetic goals for a readable layout. In each iteration the algorithm attempts to minimise the stress of the system. However, computing the minimum stress is difficult, and consequently a force-directed algorithm iteratively computes an approximation. Work has been done to improve the force-directed model, to improve how the stress is approximated in order to produce more accurate results, to improve running time and to improve the resulting layout of a graph.
Subsections
2006-11-07