Submission 127: A Maxent-Stress Model for Graph Layout

Illustrative examples

The following examples illustrate the maxent algorithm (for the paper "A Maxent-Stress Model for Graph Layout", proceedings of IEEE Pacific Visualization Symposium, 2012) , and compare it with the pmds(k) algorithms on various graphs.

Minimizing the sparse stress and maximizing the entropy makes the maxent algorithm less likely to place multiple vertices at the same location. At the same time, the algorithm still minimizes the difference between the actual and targeted edge length. The advantage of the maxent algorithm is most evident for non-rigid graphs. For mesh-like rigid graphs, PivotMDS alone is often sufficiently good.

Click on each image to see an animation of the progress of the algorithm.

Last modified: Sun Sep 25 18:51:50 EDT 2011
graph maxent pmds(1) pmds(2)
1138_bus maxent pmds(1) pmds(2)
btree9 maxent pmds(1) pmds(2)
qh882 maxent pmds(1) pmds(2)
diag maxent pmds(1) pmds(2)
fe_4elt2 maxent pmds(1) pmds(2)