Computer Engineering & Science >
A Visually Clarifying Display Algorithm for Undirected Relation Graphs
Received date: 2010-09-03
Revised date: 2010-12-28
Online published: 2011-06-25
A visually clarifying display algorithm for undirected relation graphs is proposed in this paper. Given an ordinary undirected relation graph, after it is processed by the novel algorithm determining the new positions of the vertices, it becomes more clear in aesthetic criteria. First, for a given graph, any isolated vertices are deleted, all the connected branches are decomposed. For each connected branch, it is decomposed into several cliques linked as a tree via recognizing the cut edges (bridges). Then the cliques are decomposed into several subcliques via recognizing the cut vertices. Finally, the vertices in the subclique are uniformly located in a circle. The algorithm is featured with convenient implementation, simple model, fast processing, clear output results and easy parallelization.
FANG Wenqi,HU Mingxiao . A Visually Clarifying Display Algorithm for Undirected Relation Graphs[J]. Computer Engineering & Science, 2011 , 33(6) : 51 -56 . DOI: 10.3969/j.issn.1007130X.2011.
［1］Eades P. A Heuristic for Graph Drawing［J］. Congressus Numerantium,1984(42):149160.
［2］Ron D, David H. Drawing Graphs Nicely Using Simulated Annealing［J］. ACM Transactions on Graphics,1996,15(4):301331.
［3］黄竞伟，康立山，陈毓屏．一个新的无向图画图算法［J］．软件学报，2000,11(1):138142.
［4］Charis P,Constantinos V. Drawing Graphs Using Modular Decomposition［C］∥Proc of the 13th Int’l Symp on Graph Drawing, 2005:343354.
［5］张清国，叶俊民，张维，等．用遗传算法画无向图［J］．计算机工程与科学，2006,28(6):5861.
［6］张磊，孙松，李经通，等．网络拓扑图形化显示方法及装置［P］．发明专利200910011924.0, 2009.
［7］Hong SeokHee,Hiroshi N. An Algorithm for Constructing StarShaped Drawings of Plane Graphs［J］. Computational Geometry, 2010(43):191206.
/
| 〈 |
|
〉 |