A new force-directed graph drawing method based on edge-edge repulsion
Resource
Information Visualisation, 2005. Proceedings. Ninth International Conference on
Journal
Ninth International Conference on Information Visualisation, 2005
Pages
-
Date Issued
2005-07
Date
2005-07
Author(s)
Lin, Chun-Cheng
DOI
1550-6037
Abstract
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.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
01509097.pdf
Size
210.14 KB
Format
Adobe PDF
Checksum
(MD5):b142f9d6b96e4b9f737e45807a62e22b