T. Matsubayashi and T. Yamada
A Forcedirected Graph Drawing based on the Hierarchical Individual Timestep Method
435 - 440
2007
1
3
International Journal of Electrical and Computer Engineering
https://publications.waset.org/pdf/15171
https://publications.waset.org/vol/3
World Academy of Science, Engineering and Technology
In this paper, we propose a fast and efficient method for drawing very largescale graph data. The conventional forcedirected method proposed by Fruchterman and Rheingold (FR method) is wellknown. It defines repulsive forces between every pair of nodes and attractive forces between connected nodes on a edge and calculates corresponding potential energy. An optimal layout is obtained by iteratively updating node positions to minimize the potential energy. Here, the positions of the nodes are updated every global timestep at the same time. In the proposed method, each node has its own individual time and time step, and nodes are updated at different frequencies depending on the local situation. The proposed method is inspired by the hierarchical individual time step method used for the high accuracy calculations for dense particle fields such as star clusters in astrophysical dynamics. Experiments show that the proposed method outperforms the original FR method in both speed and accuracy. We implement the proposed method on the MDGRAPE3 PCIX special purpose parallel computer and realize a speed enhancement of several hundred times.
Open Science Index 3, 2007