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
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D
GD '96 Proceedings of the Symposium on Graph Drawing
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Using Graph Layout to Visualize Train Interconnection Data
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Fast Layout Methods for Timetable Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Visualizing the global topology of the MBone
INFOVIS '96 Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96)
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Angle and distance constraints on tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
Drawing trees with perfect angular resolution and polynomial area
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'10 Proceedings of the 18th international conference on Graph drawing
Large crossing angles in circular layouts
GD'10 Proceedings of the 18th international conference on Graph drawing
TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
GD'11 Proceedings of the 19th international conference on Graph Drawing
Triangulations with circular arcs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar and poly-arc lombardi drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-Directed lombardi-style graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
On the usability of lombardi graph drawings
GD'12 Proceedings of the 20th international conference on Graph Drawing
Drawing metro maps using bézier curves
GD'12 Proceedings of the 20th international conference on Graph Drawing
Improving multiple aesthetics produces better graph drawings
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
We present a method for modifying a force-directed graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm on the test suite of the “Rome Graphs” resulted in an average improvement of 46% in angular resolution and of almost 6% in edge crossings.