Sparse stress minimization: Difference between revisions
Jump to navigation
Jump to search
(Created page with "content will follow.") |
No edit summary |
||
| Line 1: | Line 1: | ||
=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, <math>x</math>, such that <math>\sum_{i<j}w_{ij}(||x_i - x_j|| - d_{ij})^2 \text{ is as small as possible.}</math> 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. | |||
=== Complexity === | |||
Revision as of 16:51, 23 February 2017
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, , such that 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.
