Polygonal approximation of curves using binary quantum-behaved particle swarm optimization
基于二进制具有量子行为的粒子群算法的多边形近似

Quantum-behaved Particle Swarm Optimization (QPSO) algorithm was proposed to discrete binary search space. To design Binary QPSO, position vector and distance between two positions were redefined, and the iterative equation of QPSO was adjusted to binary search space. A new polygonal approximation approach based on the Binary QPSO was also presented, having solved the restriction of the search bound in BPSO. Using two common benchmark curves to test, and the results show that the algorithm accelerate the convergence rate, and get fewer points in the polygon at the same tolerance error and the same number of iterations.