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

指紋

Approximation algorithms
Chromosomes
Genes
Genetic algorithms

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, .
Huang, Shu Chien ; Sun, Yung Nien. / Determination of optimal polygonal approximation using genetic algorithms. 論文發表於 Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98, Anchorage, AK, USA, .6 p.
@conference{9f86bef1c0be44e286e1b1eb5d363196,
title = "Determination of optimal polygonal approximation using genetic algorithms",
abstract = "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.",
author = "Huang, {Shu Chien} and Sun, {Yung Nien}",
year = "1998",
month = "1",
day = "1",
language = "English",
pages = "124--129",
note = "Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 ; Conference date: 04-05-1998 Through 09-05-1998",

}

Huang, SC & Sun, YN 1998, 'Determination of optimal polygonal approximation using genetic algorithms', 論文發表於 Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98, Anchorage, AK, USA, 98-05-04 - 98-05-09 頁 124-129.

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

1998. 124-129 論文發表於 Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98, Anchorage, AK, USA, .

研究成果: 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 -

Huang SC, Sun YN. Determination of optimal polygonal approximation using genetic algorithms. 1998. 論文發表於 Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98, Anchorage, AK, USA, .