An algorithm for drawing general undirected graphs
Information Processing Letters
Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
An interactive constraint-based system for drawing graphs
Proceedings of the 10th annual ACM symposium on User interface software and technology
Orthogonal graph drawing with constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Constraints
Sketch-Driven Orthogonal Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Skeletal animation for the exploration of graphs
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
Graph interaction through force-based skeletal animation
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
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
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
Topology Preserving Constrained Graph Layout
Graph Drawing
GD'06 Proceedings of the 14th international conference on Graph drawing
Constrained stress majorization using diagonally scaled gradient projection
GD'07 Proceedings of the 15th international conference on Graph drawing
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
A map of the heap: revealing design abstractions in runtime structures
Proceedings of the 5th international symposium on Software visualization
TopicNets: Visual Analysis of Large Text Corpora with Topic Modeling
ACM Transactions on Intelligent Systems and Technology (TIST)
Layout with circular and other non-linear constraints using procrustes projection
GD'09 Proceedings of the 17th international conference on Graph Drawing
Smallworlds: visualizing social recommendations
EuroVis'10 Proceedings of the 12th 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
| Hi-index | 0.00 |
We describe a new technique for graph layout subject to constraints. Compared to previous techniques the proposed method is much faster and scalable to much larger graphs. For a graph with n nodes, m edges and c constraints it computes incremental layout in time O(n log n+m+c) per iteration. Also, it supports a much more powerful class of constraint: inequalities or equalities over the Euclidean distance between nodes. We demonstrate the power of this technique by application to a number of diagramming conventions which previous constrained graph layout methods could not support. Further, the constraint-satisfaction method-inspired by recent work in position-based dynamics--is far simpler to implement than previous methods.