Graph drawing by force-directed placement
Software—Practice & Experience
A force-directed algorithm that preserves edge-crossing properties
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Dynamic Drawing of Clustered Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Interactive Visualization of Small World Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
The "mental map" versus "static aesthetic" compromise in dynamic graphs: a user study
AUIC '08 Proceedings of the ninth conference on Australasian user interface - Volume 76
Topology Preserving Constrained Graph Layout
Graph Drawing
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
PACIFICVIS '09 Proceedings of the 2009 IEEE Pacific Visualization Symposium
Visualizing internet evolution on the autonomous systems level
GD'07 Proceedings of the 15th international conference on Graph drawing
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
Fully automatic visualisation of overlapping sets
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Scalable, versatile and simple constrained graph layout
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Hi-index | 0.00 |
PrEd [Ber00] is a force-directed algorithm that improves the existing layout of a graph while preserving its edge crossing properties. The algorithm has a number of applications including: improving the layouts of planar graph drawing algorithms, interacting with a graph layout, and drawing Euler-like diagrams. The algorithm ensures that nodes do not cross edges during its execution. However, PrEd can be computationally expensive and overlyrestrictive in terms of node movement. In this paper, we introduce ImPrEd: an improved version of PrEd that overcomes some of its limitations and widens its range of applicability. ImPrEd also adds features such as flexible or crossable edges, allowing for greater control over the output. Flexible edges, in particular, can improve the distribution of graph elements and the angular resolution of the input graph. They can also be used to generate Euler diagrams with smooth boundaries. As flexible edges increase data set size, we experience an execution/drawing quality trade off. However, when flexible edges are not used, ImPrEd proves to be consistently faster than PrEd.