BGP eye: a new visualization tool for real-time detection and analysis of BGP anomalies
Proceedings of the 3rd international workshop on Visualization for computer security
Drawing graphs with nonuniform nodes using potential fields
Journal of Visual Languages and Computing
Maximizing the total resolution of graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Visualising web browsing data for user behaviour analysis
Proceedings of the 23rd Australian Computer-Human Interaction Conference
| Hi-index | 0.00 |
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-directed method based on edge-edge repulsion to draw graphs. In our framework, edges are modelled as charged springs, and a final drawing can be generated by adjusting positions of vertices according to spring forces and the repulsive forces, derived from potential fields, among edges. Different from the previous methods, our new framework has the advantage of overcoming the problem of zero angular resolution, guaranteeing the absence of any overlapping of edges incident to the common vertex. Given graph layouts probably generated by classical algorithms as the inputs to our algorithm, experimental results reveal that our approach produces promising drawings (especially for trees and hypercubes) not only preserving the original properties of a high degree of symmetry and uniform edge length, but also preventing zero angular resolution. By allowing vertex-vertex overlapping, our algorithm also results in more symmetrical drawings.