On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
DAG—a program that draws directed graphs
Software—Practice & Experience
An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Computational geometry in C
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Practical reusable UNIX software
Drawing graphs to convey proximity: an incremental arrangement method
ACM Transactions on Computer-Human Interaction (TOCHI)
SCG '85 Proceedings of the first annual symposium on Computational geometry
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Short and Smooth Polygonal Paths
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Spring Algorithms and Symmetry
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
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
Graph Layout Adjustment Strategies
GD '95 Proceedings of the Symposium on Graph Drawing
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
NicheWorks - Interactive Visualization of Very Large Graphs
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Cluster busting in anchored graph drawing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Uncluttering force-directed graph layouts
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Fast Layout Methods for Timetable Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Visualizing software for telecommunication services
Proceedings of the 2003 ACM symposium on Software visualization
Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm
IEEE Transactions on Visualization and Computer Graphics
Flexible layering in hierarchical drawings with nodes of arbitrary size
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Using spring algorithms to remove node overlapping
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
TreePlus: Interactive Exploration of Networks with Enhanced Tree Layouts
IEEE Transactions on Visualization and Computer Graphics
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction
IEEE Transactions on Visualization and Computer Graphics
Visual Exploration of Complex Time-Varying Graphs
IEEE Transactions on Visualization and Computer Graphics
Network Visualization by Semantic Substrates
IEEE Transactions on Visualization and Computer Graphics
MOVIS: A system for visualizing distributed mobile object environments
Journal of Visual Languages and Computing
Removing Node Overlaps Using Multi-sphere Scheme
Graph Drawing
Drawing graphs with non-uniform vertices
Proceedings of the Working Conference on Advanced Visual Interfaces
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
Hierarchically organized layout for visualization of biochemical pathways
Artificial Intelligence in Medicine
Multi-circular layout of micro/macro graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Multi-con: exploring graphs by fast switching among multiple contexts
Proceedings of the International Conference on Advanced Visual Interfaces
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
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
A visual interactive framework for formal derivation
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
A hierarchical tree layout algorithm with an application to corporate management in a change process
Expert Systems with Applications: An International Journal
TagClusters: Enhancing Semantic Understanding of Collaborative Tags
International Journal of Creative Interfaces and Computer Graphics
Visualizing streaming text data with dynamic graphs and maps
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected graphs. Aspects of symmetry, structure, clustering and reasonable vertex distribution arise from initial, formless clouds of points. However, when nodes must be labeled and point vertices are replaced by non-point vertices, simple force-directed models produce unreadable drawings, even for a moderate number of nodes. This paper describes the application of two post-processing techniques that can be applied to any initial vertex layout to produce uncluttered layouts with non-point nodes.