Edge concentration: a method for clustering directed graphs
SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Fast hierarchical clustering and other applications of dynamic closest pairs
Journal of Experimental Algorithmics (JEA)
An open graph visualization system and its applications to software engineering
Software—Practice & Experience - Special issue on discrete algorithm engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Circular Layout in the Graph Layout Toolkit
GD '96 Proceedings of the Symposium on Graph Drawing
Maintaining the Mental Map for Circular Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
GD'06 Proceedings of the 14th international conference on Graph drawing
Multi-circular layout of micro/macro graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
GD'10 Proceedings of the 18th international conference on Graph drawing
Improving layered graph layouts with edge bundling
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
An empirical study on the impact of edge bundling on user comprehension of graphs
Proceedings of the International Working Conference on Advanced Visual Interfaces
Graph Bundling by Kernel Density Estimation
Computer Graphics Forum
Image-based edge bundles: simplified visualization of large graphs
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
StreamEB: stream edge bundling
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node placement often gives rise to long edges and an overall dense drawing. We suggest here three independent, complementary techniques for lowering the density and improving the readability of circular layouts. First, a new algorithm is given for placing the nodes on the circle such that edge lengths are reduced. Second, we enhance the circular drawing style by allowing some of the edges to be routed around the exterior of the circle. This is accomplished with an algorithm for optimally selecting such a set of externally routed edges. The third technique reduces density by coupling groups of edges as bundled splines that share part of their route. Together, these techniques are able to reduce clutter, density and crossings compared with existing methods.