期刊文献+

基于遗传模拟退火算法的图的三维可视化 被引量:7

Three-dimensional Visualization of Graph Based on the Genetic Simrlated Annealing Algorithm
下载PDF
导出
摘要 将模拟退火算法中的扰动选择和加速适应函数的思想融入基本遗传算法 ,提出了图的三维可视化的遗传模拟退火算法 该算法有效克服了基本遗传算法局部搜索能力较差的缺点 ,是一种性能优良的全局优化搜索算法 试验结果表明该算法在图的三维可视化效果。 Combining the simulated annealing algorithm with the general genetic algorithm,this paper puts forward the genetic simulated annealing algorithm for the three dimensional visualization of graph.The shortcoming of the general genetic algorithm,imperfect part searching capability,is overcone effectively in this overall optimal searching algorithm.It has also been testeb that the visualizing resultmefficiency of graph,and visualizing stability of big graph are improved inthes algoritm.
出处 《广东工业大学学报》 CAS 2002年第1期37-41,共5页 Journal of Guangdong University of Technology
关键词 三维可视化 遗传模拟退火算法 计算机科学 graph visualization genetic simulated annealing algorithm
  • 相关文献

参考文献2

二级参考文献7

  • 11.Battista G D, Eades P, Tamassia R et al. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 1994,4(5):235~282
  • 22.Kamada T, Kawai S. An algorithm for drawing general undirected graph. Information Letters, 1989,31(1):7~15
  • 33.Fruchterman T M J , Reingold E M. Graph drawing by force-directed placement. Software-Practice and Experience, 1991,21(11):1129~1164
  • 44.Kosak C, Marks J, Shieber S. Automating the layout of network diagrams with specified visual organization. IEEE Transactions on System, Man and Cybernetics, 1994,24(3):440~454
  • 55.Michalewicz Z. Genetic Algorithms+Data Structures=Evolution Programs. 3rd edition, New York: Springer-Verlag, 1996
  • 6李文辉,Proc of the 4th International CG/CAD Conf,1995年
  • 7李文辉,Proc of Golden West International Conf of Intelligent System,1992年

共引文献25

同被引文献64

  • 1张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,15(8):1220-1226. 被引量:64
  • 2吴伟民,樊敏,曹勇峰.动态图的实时三维可视化的稳定性算法[J].计算机工程与设计,2005,26(3):801-802. 被引量:6
  • 3Helen C.Purchase. Metrics for Graph Drawing Aesthetics[J]. Journal of Visual Languages and Computing,2002,13 (5): 501-516.
  • 4Tomihisa Kamada. Visualizing Abstract Objects and Relations [M]. HongKong: World Scientific Publishing Co Pte Ltd, 1989:69-104.
  • 5Francois Bertauh,a Force-Directed Algorithm that Preserves Edge-Crossing Properties[J]. Information Processing Letters,2000:7-13.
  • 6严蔚敏.数据结构(C语言版)[M].北京:清华大学出版社,2001,1..
  • 7Tomihisa Kamada. Visualizing abstract objects and relations [M]. HongKong: World Scientific Publishing Co Pre Ltd, 1989.69、104.
  • 8Symposium on Graph Drawing(GD)1994-2002[EB/OL].LNCS 894, LNCS 1027, LNCS 1190, LNCS 1353, LNCS 1547, LNCS 1731, LNCS 1984, LNCS 2265, LNCS 2528. http://www. cs.brown.edu/people/rt/gd.html.
  • 9Pawel Gajer, Michael T Goodrich. A fast multi-dimensional algorithm for drawing large graphs [Z].
  • 10Closson M, Gartshore S. Fully dynamic 3-dimensional orthogonal graph drawing [J]. Journal of Graph Algorithms and Applications, 2000, 5(2): 1-34.

引证文献7

二级引证文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部