A hierarchical orderly layout algorithm based on channel points

Yi Kun Zhang, Kai Bao Hu,Xin Hong Hei,Ming Zhao, Ming Hui Zhang,Hao Chen

PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE AND ELECTRONICS INFORMATION (ICACSEI 2013)(2013)

引用 23|浏览8
暂无评分
摘要
Since the conventional hierarchical layout algorithm has the disadvantage of wiring chaos in large programs, so on the basis of Sugiyama layout algorithm, this paper proposes a hierarchical orderly layout algorithm based on channel points. Adjust the number of each node in the channel dynamically according to program size in order to solve the existing algorithm's overlap problems when wiring lines, Combine the generalized tensor balance idea in layout diagram to reduce cross and realize the artistic layout, the algorithm also give the corresponding line distribution and application strategy in accordance with the relative positional relationship between the calling nodes to achieve the routing orderly. Experiment results show that the algorithm has good layout efficiency. It can reduce the crossings effectively, be realized layout clearly and be implemented simply.
更多
查看译文
关键词
Software visualization,hierarchical graph,generalized tensor balance algorithm,crossing minimization,channel routing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要