Constrained stress majorization using diagonally scaled gradient projection

Authors:
Tim Dwyer;Kim Marriott
Affiliations:
Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia;Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 5
Cited 1

An algorithm for drawing general undirected graphs

Information Processing Letters
“ACCEL” automated circuit card etching layout

DAC '65 Proceedings of the SHARE design automation project
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs

IEEE Transactions on Visualization and Computer Graphics
Integrating edge routing into force-directed layout

GD'06 Proceedings of the 14th international conference on Graph drawing
Graph drawing by stress majorization

GD'04 Proceedings of the 12th international conference on Graph Drawing

Scalable, versatile and simple constrained graph layout

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly improve the speed and convergence properties of the constrained stress-majorization technique for graph layout by employing a diagonal scaling of the stress function. Diagonal scaling requires the active-set quadratic programming solver used in the projection step to be extended to handle separation constraints with scaled variables, i.e. of the form siyi + gij ≤ sjyj. The changes, although relatively small, are quite subtle and explained in detail.