### 摘要

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 五月 4 → 1998 五月 9 |

### Other

Other | Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 |
---|---|

城市 | Anchorage, AK, USA |

期間 | 98-05-04 → 98-05-09 |

### 指紋

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Engineering(all)

### 引用此文

*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, .

}

**Determination of optimal polygonal approximation using genetic algorithms.** / Huang, Shu Chien; Sun, Yung Nien.

研究成果: Paper

TY - CONF

T1 - Determination of optimal polygonal approximation using genetic algorithms

AU - Huang, Shu Chien

AU - Sun, Yung Nien

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031648375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031648375&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0031648375

SP - 124

EP - 129

ER -