Determination of optimal polygonal approximation using genetic algorithms

Shu Chien Huang, Yung Nien Sun

研究成果: Paper

2 引文 斯高帕斯(Scopus)

摘要

A new polygonal-approximation algorithm is presented which gives the minimum number of sides for the approximated polygon under a uniform error norm. In the proposed method, a chromosome is used to represent a polygon and is represented by a binary string. Each bit, called a gene, represents a point on the given curve. The convergence of the method is guaranteed and the optimal or near-optimal solutions can be obtained. Some experimental results depict the feasibility of the proposed approach.

原文English
頁面124-129
頁數6
出版狀態Published - 1998 一月 1
事件Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 - Anchorage, AK, USA
持續時間: 1998 五月 41998 五月 9

Other

OtherProceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98
城市Anchorage, AK, USA
期間98-05-0498-05-09

    指紋

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

引用此

Huang, S. C., & Sun, Y. N. (1998). Determination of optimal polygonal approximation using genetic algorithms. 124-129. 論文發表於 Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98, Anchorage, AK, USA, .