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
The growing studies show that the human brain can comprehend increasingly complex structures if they...
Symmetry is one of the most important aesthetic criteria on graph drawing. It is quite necessary to ...
This paper focuses on graph layouts with constraints using force-directed simulations. Existing grap...
We present a method for modifying a force-directed graph drawing algorithm into an algorithm for dra...
A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represen...
Recent empirical research has indicated that human graph read-ing performance improves when crossing...
The conventional force-directed methods for drawing undirected graphs are based on either vertex-ver...
We present an iterative drawing algorithm for undirected graphs, based on a force-directed approach,...
This paper studies the problem of designing graph drawing algorithms that guarantee good trade-offs ...
We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm...
We propose FlexGD, a force-directed algorithm for straightline undirected graph drawing. The algorit...
Modern visual analytics tools provide mechanism for users to gain unknown knowledge through effectiv...
We present a modification of the spring-embedder model of Eades [Congressus Numerantiurn, 42, 149-16...
The automatic layout of metro maps has been investigated quite intensely over the last few years. Pr...
The automatic layout of metro maps has been investigated quite intensely over the last few years. Pr...
The growing studies show that the human brain can comprehend increasingly complex structures if they...
Symmetry is one of the most important aesthetic criteria on graph drawing. It is quite necessary to ...
This paper focuses on graph layouts with constraints using force-directed simulations. Existing grap...
We present a method for modifying a force-directed graph drawing algorithm into an algorithm for dra...
A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represen...
Recent empirical research has indicated that human graph read-ing performance improves when crossing...
The conventional force-directed methods for drawing undirected graphs are based on either vertex-ver...
We present an iterative drawing algorithm for undirected graphs, based on a force-directed approach,...
This paper studies the problem of designing graph drawing algorithms that guarantee good trade-offs ...
We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm...
We propose FlexGD, a force-directed algorithm for straightline undirected graph drawing. The algorit...
Modern visual analytics tools provide mechanism for users to gain unknown knowledge through effectiv...
We present a modification of the spring-embedder model of Eades [Congressus Numerantiurn, 42, 149-16...
The automatic layout of metro maps has been investigated quite intensely over the last few years. Pr...
The automatic layout of metro maps has been investigated quite intensely over the last few years. Pr...
The growing studies show that the human brain can comprehend increasingly complex structures if they...
Symmetry is one of the most important aesthetic criteria on graph drawing. It is quite necessary to ...
This paper focuses on graph layouts with constraints using force-directed simulations. Existing grap...