PSOGD: A New Method for Graph Drawing

被引:0
|
作者
Qu, Jianhua [1 ]
Song, Yi [1 ]
Bressan, Stephane [1 ]
机构
[1] Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Peoples R China
来源
2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW) | 2013年
关键词
ALGORITHM;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Force-directed graph drawing algorithms compute a layout as the equilibrium of a physical system. This equilibrium is an optimum of the corresponding objective function. We propose a new method for drawing undirected graphs that uses particle swarm optimization (PSO). The graph is initialized with a swarm of random particles. The position vector of each particle corresponds to one layout of the graph. The objective function maps the layout into a real number representing the energy of the layout which is obtained by calculating the attractive and repulsive forces between the vertices. All particles automatically update their position and velocity to find the optimal layout until the algorithm terminates. PSO makes the implementation of the algorithm simple and easy. We empirically and comparatively evaluate the performance of the algorithm.
引用
收藏
页码:229 / 235
页数:7
相关论文
共 50 条
  • [41] On the Complexity of Lombardi Graph Drawing
    Jungeblut, Paul
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2023, PT I, 2023, 14465 : 180 - 194
  • [42] Graph Drawing Contest Report
    Gutwenger, Carsten
    Loeffler, Maarten
    Nachmanson, Lev
    Rutter, Ignaz
    GRAPH DRAWING (GD 2014), 2014, 8871 : 501 - 506
  • [43] Online dynamic graph drawing
    Frishman, Yaniv
    Tal, Ayellet
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2008, 14 (04) : 727 - 740
  • [44] A grammatical approach to graph drawing
    Brandenburg, FJ
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1996, 76 : 44 - 46
  • [45] Online hierarchical graph drawing
    North, SC
    Woodhull, G
    GRAPH DRAWING, 2002, 2265 : 232 - 246
  • [46] Graph Drawing Contest Report
    Duncan, Christian A.
    Gutwenger, Carsten
    Nachmanson, Lev
    Sander, Georg
    GRAPH DRAWING, 2010, 5849 : 428 - +
  • [47] A library of algorithms for graph drawing
    Gutwenger, C
    Jünger, M
    Klau, GW
    Leipert, S
    Mutzel, P
    Weiskircher, R
    GRAPH DRAWING, 2002, 2265 : 473 - 474
  • [48] Evolutionary Graph Drawing Algorithms
    Huang Jing-wei
    Wuhan University Journal of Natural Sciences, 2003, (S1) : 212 - 216
  • [49] A library of algorithms for graph drawing
    Mutzel, P
    Gutwenger, C
    Brockenauer, R
    Fialko, S
    Klau, G
    Krüger, M
    Ziegler, T
    Näher, S
    Alberts, D
    Ambras, D
    Koch, G
    Jünger, M
    Buchheim, C
    Leipert, S
    GRAPH DRAWING, 1998, 1547 : 456 - 457
  • [50] Colorability in orthogonal graph drawing
    Stola, Jan
    GRAPH DRAWING, 2008, 4875 : 327 - 338