An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
A multi scale algorithm for drawing graphs nicely
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Constraint-Based Spring-Model Algorithm for Graph Layout
GD '95 Proceedings of the Symposium on Graph Drawing
GD '95 Proceedings of the Symposium on Graph Drawing
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Visualizing software for telecommunication services
Proceedings of the 2003 ACM symposium on Software visualization
Using spring algorithms to remove node overlapping
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction
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
Network Visualization by Semantic Substrates
IEEE Transactions on Visualization and Computer Graphics
A new algorithm for removing node overlapping in graph visualization
Information Sciences: an International Journal
TopoLayout: Multilevel Graph Layout by Topological Features
IEEE Transactions on Visualization and Computer Graphics
Multi-Level Graph Layout on the GPU
IEEE Transactions on Visualization and Computer Graphics
MOVIS: A system for visualizing distributed mobile object environments
Journal of Visual Languages and Computing
A layout algorithm for undirected compound graphs
Information Sciences: an International Journal
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Drawing graphs with nonuniform nodes using potential fields
Journal of Visual Languages and Computing
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
Drawing graphs using modular decomposition
GD'05 Proceedings of the 13th international conference on Graph Drawing
Rolled-out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives
Computer Graphics Forum
Visual access to graph content using magic lenses and filtering
Proceedings of the 28th Spring Conference on Computer Graphics
GD'12 Proceedings of the 20th international conference on Graph Drawing
Interactive by-example design of artistic packing layouts
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
The vertices of most graphs that appear in real applications are non-uniform. They can be circles, ellipses, rectangles, or other geometric elements of varying shapes and sizes. Unfortunately, current force directed methods for laying out graphs are suitable mostly for graphs whose vertices are zero-sized and dimensionless points. It turns out that naively extending these methods to handle non-uniform vertices results in serious deficiencies in terms of output quality and performance. In this paper we try to remedy this situation by identifying the special characteristics and problematics of such graphs and offering several algorithms for tackling them. The algorithms can be viewed as carefully constructed extensions of force-directed methods, and their output quality and performance are similar.