The visual display of quantitative information
The visual display of quantitative information
Edge concentration: a method for clustering directed graphs
SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
Journal of Information Processing
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
Geometry-Based Edge Clustering for Graph Visualization
IEEE Transactions on Visualization and Computer Graphics
GD'06 Proceedings of the 14th international conference on Graph drawing
Line crossing minimization on metro maps
GD'07 Proceedings of the 15th international conference on Graph drawing
GD'07 Proceedings of the 15th international conference on Graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
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
Edge routing with ordered bundles
GD'11 Proceedings of the 19th international conference on Graph Drawing
Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts
GD'11 Proceedings of the 19th international conference on Graph Drawing
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Rank-directed layout of UML class diagrams
Proceedings of the First International Workshop on Software Mining
Exact Approaches to Multilevel Vertical Orderings
INFORMS Journal on Computing
| Hi-index | 0.00 |
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges. We give several implementations that vary in quality of the resulting layout and execution time. To diminish the number of edge crossings inside of the bundles we apply a metro-line crossing minimization technique. The method preserves the Sugiyama style of the layout and creates a more readable view of the graph.