Determination of optimal polygonal approximation using genetic algorithms

Shu Chien Huang; Yung Nien Sun

Determination of optimal polygonal approximation using genetic algorithms

Shu Chien Huang, Yung Nien Sun

Department of Computer Science and Information Engineering

Research output: Contribution to conference › Paper › peer-review

2 Citations (Scopus)

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.

Original language	English
Pages	124-129
Number of pages	6
Publication status	Published - 1998
Event	Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98 - Anchorage, AK, USA Duration: 1998 May 4 → 1998 May 9

Other

Other	Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, ICEC'98
City	Anchorage, AK, USA
Period	98-05-04 → 98-05-09

All Science Journal Classification (ASJC) codes

General Computer Science
General Engineering

Cite this

@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",

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",

}

TY - CONF

T1 - Determination of optimal polygonal approximation using genetic algorithms

AU - Huang, Shu Chien

AU - Sun, Yung Nien

PY - 1998

Y1 - 1998

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

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

Y2 - 4 May 1998 through 9 May 1998

ER -

Determination of optimal polygonal approximation using genetic algorithms

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this