首页 | 本学科首页   官方微博 | 高级检索  
     

基于遗传算法的平面图平面正交直线画图算法
引用本文:张清国,金聪,林春. 基于遗传算法的平面图平面正交直线画图算法[J]. 计算机工程与设计, 2005, 26(2): 467-469
作者姓名:张清国  金聪  林春
作者单位:华中师范大学,计算机系,湖北,武汉,430079;广州金鹏集团有限公司,广东,广州,510665
摘    要:提出了一种基于遗传算法的新的平面图平面正交直线画图算法,算法将平面图画图问题转化为约束优化问题,根据画图问题选定的美观准则构造约束函数,用遗传算法求解目标函数的最优解的近似值,从而得到平面图的平面正交直线画法。新算法的优点是方法简单,易于实现,画出的图形美观,算法稳定性好。实验结果表明,画图算法的最终结果不依赖于图的初始状态。

关 键 词:遗传算法  平面图  画图  美观准则  平面正交直线画法
文章编号:1000-7024(2005)02-0467-03

Planar orthogonal straight-line drawing algorithm of planar graph based on genetic algorithm
ZHANG Qing-guo,JIN Cong,LIN Chun. Planar orthogonal straight-line drawing algorithm of planar graph based on genetic algorithm[J]. Computer Engineering and Design, 2005, 26(2): 467-469
Authors:ZHANG Qing-guo  JIN Cong  LIN Chun
Abstract:A new planar graph planar orthogonal straight-line drawing algorithm is proposed which is based on genetic algorithm. The algorithm transforms the problem of planar graph drawing to that of constraint optimization, and constructs a function with constraints according to the aesthetic criteria of graph drawing problem, and then uses genetic algorithms to find approximate optimal solutions to the objective function, and thus obtains a planar orthogonal straight-line drawing of the planar graph. The new algorithm is of following advantages: the method is simple and it is easier to be implemented and also the figure drawn is beautiful, finally, the algorithm is stable. The experiment results show that the final results of the drawing algorithm don't rely on the initial status of graphs.
Keywords:genetic algorithm  planar graph  graph drawing  aesthetic criteria  planar orthogonal straight-line drawing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号