An efficient evolutionary algorithm for accurate polygonal approximation

DOI10.1016/S0031-3203(00)00159-XzbMath0991.68128OpenAlexW2092290841WikidataQ60047213 ScholiaQ60047213MaRDI QIDQ5953123

Shinn-Ying Ho, Yeong-Chinq Chen

Publication date: 3 September 2002

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(00)00159-x

zbMATH Keywords

genetic algorithmevolutionary algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

Enhancing the performance of differential evolution using orthogonal design method ⋮ Design of nearest neighbor classifiers: Multi-objective approach ⋮ Polygonal approximation of closed discrete curves ⋮ Mesh optimization for surface approximation using an efficient coarse-to-fine evolutionary algorithm ⋮ Polygonal approximation using integer particle swarm optimization ⋮ Data reduction of large vector graphics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Genetic algorithms and traveling salesman problems
• Another look at the dominant point detection of digital curves
• On the approximation of curves by line segments using dynamic programming
• Polygonal approximation by the minimax method
• Polygonal Approximations by Newton's Method
• Algorithms for straight line fitting using k-means
• A new method for polygonal approximation using genetic algorithms
• Optimum polygonal approximation of digitized curves
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

This page was built for publication: An efficient evolutionary algorithm for accurate polygonal approximation