An algorithm for drawing general undirected graphs
Information Processing Letters
Inserting an edge into a planar graph
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Drawing graphs
Constraints
InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Online Hierarchical Graph Drawing
GD '01 Revised Papers from the 9th International Symposium 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
Exploration of Networks using overview+detail with Constraint-based cooperative layout
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
GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'09 Proceedings of the 17th international conference on Graph Drawing
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Layout with circular and other non-linear constraints using procrustes projection
GD'09 Proceedings of the 17th international conference on Graph Drawing
Aesthetic layout of wiring diagrams
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Scalable, versatile and simple constrained graph layout
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Planar preprocessing for spring embedders
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
Constrained graph layout is a recent generalisation of force-directed graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the topology of the initial layout. The algorithm supports poly-line connectors and clusters. During layout the connectors and cluster boundaries act like impervious rubber-bands which try to shrink in length. The intended application for our algorithm is dynamic graph layout, but it can also be used to improve layouts generated by other graph layout techniques.