A Boundary Representation Based on Polygonal Approximation with an Ant Colony Algorithm for the Two-Dimensional Objects

植基於蟻群繁殖演算法之多邊形逼近法於二維物體邊界表示之研究

劉紹漢(Shao-Han Liu) ； 林灶生(Jzau-Sheng Lin) ； 林資勝(Zi-Sheng Lin)

《勤益學報》 24期 (2006/12) Pp. 255-269

https://doi.org/10.6753/CYJ.200612.0255

摘要

本文旨在使用蟻群繁殖演算法於多邊形逼近法，用以表示二度空間物件之邊界。近來蟻群繁殖演算法在統計研究領域中，是一種新的優化演算法。在所提出的方法中，根據費洛蒙強度和曲線中弧對弦距離，我們以螞蟻發現曲線在來源和目的地之間最佳決策點的能力，修建一種蟻群繁殖演算法(Ant colony Algorithm, ACA)。實驗結果顯示，我們所提出的ACA方法以輪盤的賭輪選擇，比傳統多邊形逼近法可獲得更好的表現。

關鍵字

多邊形逼近法 ； 蟻群繁殖演算

並列摘要

This paper investigates polygonal approximation in boundary representation for two-dimensional objects using an ant colony algorithm. Ant colony algorithm is a newly optimization algorithm for the field of stochastic researching recently. In the proposed approach, in according with the pheromone strength and the arc-to-chord distance for a curve, we construct an optimizing Ant Colony Algorithm (ACA) that based on the ability of ants to find the optimal dominant points in a curve between the source and destination. The experimental results show that the proposed ACA with the roulette wheel selection can obtain better performance than that generated by the conventional polygonal approximation methods.

並列關鍵字

Polygonal Approximation ； Ant Colony Algorithm