作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (22): 197-199. doi: 10.3969/j.issn.1000-3428.2010.22.071

• 人工智能及识别技术 • 上一篇    下一篇

基于蚁群算法的最小权三角剖分求解

李木子1a,闫建华1b,国海涛1b,刘金义2   

  1. (1 鲁东大学 a. 办公室;b. 信息工程学院,山东 烟台 264025;2. 辽宁石油化工大学计算机与通信工程科学学院,辽宁 抚顺 113001)
  • 出版日期:2010-11-20 发布日期:2010-11-18
  • 作者简介:李木子(1974-),女,讲师、硕士,主研方向:蚁群算法,人工智能,图形学;闫建华,讲师、硕士;国海涛,助教、硕士;刘金义,教授、博士
  • 基金资助:
    国家自然科学基金资助项目(60673102)

Minimum Weight Triangulation Solving Based on Ant Colony Algorithm

LI Mu-zi1a, YAN Jian-hua1b, GUO Hai-tao1b, LIU Jin-yi2   

  1. (1a. Office; 1b. School of Information Engineering, Ludong University, Yantai 264025, China;2. School of Computer and Communication Engineering, Liaoning University of Petroleum & Chemical Technology, Fushun 113001, China)
  • Online:2010-11-20 Published:2010-11-18

Abstract: To solve the defects of slow convergence and prematurity that is common in the known algorithms for Minimum Weight Triangulation(MWT), the conception and algorithm of the maximum of allowable triangulation for point set is proposed, thereby ant colony algorithm can be applied to MWT successfully. Diagonal exchange rule is put forward to speed up convergence ability of algorithm. Experimental result shows that the algorithm’s the convergence velocity, the ability to resist prematurity to converge and run time is much better than the existing algorithms.

Key words: Ant Colony Algorithm(ACA), Minimum Weight Triangulation(MWT), prematurity, computer vision, hormone

中图分类号: