Sparse stress minimization

Sparse Stress Layout

Method

The Sparse Stress Layout is a heuristic to approximate the (full) stress layout. The goal of the stress minimization is to find a layout, $x$, such that $\sum _{i<j}w_{ij}(||x_{i}-x_{j}||-d_{ij})^{2}{\text{ is as small as possible.}}$ In other words stress tries to find a layout in which the euclidean distance of each pair of nodes matches their graph-theoretical distance, i.e. shortest-path distance.