Abstract
Constrained stress majorization is a promising new technique for integrating application specific layout constraints into force-directed 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 s i y i ∈+∈g ij ≤ s j y j . The changes, although relatively small, are quite subtle and explained in detail. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Dwyer, T., & Marriott, K. (2008). Constrained stress majorization using diagonally scaled gradient projection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 219–230). https://doi.org/10.1007/978-3-540-77537-9_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.