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
Exploration of Networks using overview+detail with Constraint-based cooperative layout
IEEE Transactions on Visualization and Computer Graphics
Topology Preserving Constrained Graph Layout
Graph Drawing
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'06 Proceedings of the 14th international conference on Graph drawing
Multi-circular layout of micro/macro graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Scalable, versatile and simple constrained graph layout
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Recent work on constrained graph layout has involved projection of simple two-variable linear equality and inequality constraints in the context of majorization or gradient-projection based optimization. While useful classes of containment, alignment and rectangular non-overlap constraints could be built using this framework, a severe limitation was that the layout used an axis-separation approach such that all constraints had to be axis aligned. In this paper we use techniques from Procrustes Analysis to extend the gradient-projection approach to useful types of non-linear constraints. The constraints require subgraphs to be locally fixed into various geometries—such as circular cycles or local layout obtained by a combinatorial algorithm (e.g. orthogonal or layered-directed)—but then allow these sub-graph geometries to be integrated into a larger layout through translation, rotation and scaling.