Stress majorization with orthogonal ordering constraints

Authors:
Tim Dwyer;Yehuda Koren;Kim Marriott
Affiliations:
School of Comp. Science & Soft. Eng., Monash University, Australia;AT&T — Research;School of Comp. Science & Soft. Eng., Monash University, Australia
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 8
Cited 8

An algorithm for drawing general undirected graphs

Information Processing Letters
An interactive constraint-based system for drawing graphs

Proceedings of the 10th annual ACM symposium on User interface software and technology
Matrix market: a web resource for test matrix collections

Proceedings of the IFIP TC2/WG2.5 working conference on Quality of numerical software: assessment and enhancement
Constrained Graph Layout

Constraints
Combining Hierarchy and Energy Drawing Directed Graphs

IEEE Transactions on Visualization and Computer Graphics
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization

INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
Graph drawing by stress majorization

GD'04 Proceedings of the 12th international conference on Graph Drawing
The metro map layout problem

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

Drawing Directed Graphs Using Quadratic Programming

IEEE Transactions on Visualization and Computer Graphics
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs

IEEE Transactions on Visualization and Computer Graphics
A Fast and Simple Heuristic for Metro Map Path Simplification

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
On the Hardness of Orthogonal-Order Preserving Graph Drawing

Graph Drawing
Visualization of Riemannian-manifold-valued elements by multidimensional scaling

Neurocomputing
On d-regular schematization of embedded paths

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Path schematization for route sketches

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On d-regular schematization of embedded paths

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The adoption of the stress-majorization method from multi-dimensio- nal scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we give an algorithm for augmenting such stress-majorization techniques with orthogonal ordering constraints and we demonstrate several graph-drawing applications where this class of constraints can be very useful.