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
CLC Number:
LI Mu-Zi, YAN Jian-Hua, GUO Hai-Chao, LIU Jin-Xi. Minimum Weight Triangulation Solving Based on Ant Colony Algorithm[J]. Computer Engineering, 2010, 36(22): 197-199.
李木子, 闫建华, 国海涛, 刘金义. 基于蚁群算法的最小权三角剖分求解[J]. 计算机工程, 2010, 36(22): 197-199.