Particle Swarm Algorithm for the Shortest Bezier Curve

Abstract

Bezier curves have become fundamental tools in many challenging and varied applications, ranging from computer- aided geometric design to generic object shape descriptors. Bezier curves have wide applications because they are easy to compute and very stable. Based on analysis of Bezier curve, the problem of the shortest Bezier curve is discussed in this paper. Furthermore, the particle swarm algorithm for this problem is presented. At last, examples are given.