A Hybrid Genetic Algorithm for Two Types of Polygonal Approximation Problems

DOI10.1007/978-3-540-37258-5_4MaRDI QIDQ3063016zbMATH OpenOpenAlexFDO

Authors Bin Wang, Chaojian Shi

Publication date 30 December 2010

Published in Intelligent Computing in Signal Processing and Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-37258-5_4

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Application of orthogonal and other special functions (94A11)

Recommendations

• A new method for polygonal approximation using genetic algorithms
• An efficient evolutionary algorithm for accurate polygonal approximation
• scientific article; zbMATH DE number 953063
• A hybrid genetic algorithm for a type of nonlinear programming problem
• scientific article; zbMATH DE number 2013538
• On genetic algorithms for the packing of polygons
• A hybrid genetic algorithm for integer programming and its convergence
• scientific article; zbMATH DE number 2079469
• On the effectiveness of the genetic paradigm for polygonization

Cited in

(2)

• A split/merge method with ranking selection for polygonal approximation of digital curve
• An efficient evolutionary algorithm for accurate polygonal approximation

This page was built for publication: A Hybrid Genetic Algorithm for Two Types of Polygonal Approximation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3063016)