Polygonal approximation using integer particle swarm optimization

DOI10.1016/j.ins.2014.03.055zbMath1354.68282OpenAlexW2072006782MaRDI QIDQ506726

Yongsheng Gao, Hanxi Li, Jie Cao, Bin Wang, Douglas K. Brown, Xiao-Zheng Zhang

Publication date: 2 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/67125

zbMATH Keywords

genetic algorithmspolygonal approximationparticle swarm optimizationbinary version of PSOinteger coding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Dominant point detection based on discrete curve structure and applications

Cites Work

• Polygonal approximation of digital planar curves through break point suppression
• Polygonal approximation of closed discrete curves
• Ant colony search algorithms for optimal polygonal approximation of plane curves.
• Optimized polygonal approximation by dominant point deletion
• Polygonal approximation of digital planar curves through vertex betweenness
• A new method for polygonal approximation using genetic algorithms
• Optimum polygonal approximation of digitized curves
• Optimal polygonal approximation of digital planar curves using meta heuristics
• An efficient evolutionary algorithm for accurate polygonal approximation

This page was built for publication: Polygonal approximation using integer particle swarm optimization