PSO-Based Generating Algorithm for Parametric Curve

Abstract:

Article Preview

This paper presents a generating algorithm at pixel level for parametric curve. The parallel particle sub-swarm optimization is used to search the optimal step of curve in forward. Large amount of repeated computing for points are avoided and the result is precise enough. Simulation results show that the parallel method based on particle sub-swarm can be used for searching the optimal step of parametric curve with any degree quickly. At the same time, compared with other methods, this algorithm produces the maximum step efficiently. Since there is no restriction on control point position and curve degree, the algorithm can be extended easily to other parametric curves besides Bézier curves.

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Edited by:

Yanwen Wu

Pages:

611-616

Citation:

Z. J. Li et al., "PSO-Based Generating Algorithm for Parametric Curve", Key Engineering Materials, Vols. 439-440, pp. 611-616, 2010

Online since:

June 2010

Export:

Price:

$41.00

[1] F.H. Guo. Optimal Parameterization of Parametric Curves [J]. Journal of Computer-Aided Design & Computer Graphics, 2007, 19(4): 464-467.

[2] S.L. Lien, M. Shantz, V. Pratt. Adaptive forward differencing for rendering curves and surfaces [J]. Computer Graphics, 1987, 21(4): 111-118.

DOI: https://doi.org/10.1145/37402.37416

[3] S.L. Chang, M. Shantz, R. Rocchetti. Rendering cubic curves and surfaces with integer adaptive forward differencing [J]. Computer Graphics, 1989, 23(3): 157-166.

DOI: https://doi.org/10.1145/74334.74349

[4] R.V. Klassen. Integer forward differencing of cubic polynomials: Analysis and algorithms [J]. ACM Transactions on Graphics, 1991, 10(2): 152-181.

DOI: https://doi.org/10.1145/108360.108364

[5] Y.K. Liu, J.Y. Shi. An All-Integer Arithmetic Algorithm for Drawing Curves [J]. Chinese Journal of Computers, 1998, 21(3): 270-280.

[6] Y.D. Huang, G.Q. Zhu. A Fast Point-by-Point Generating Algorithm for Polynomial Parametric Curve.

[7] Y.K. Liu, X.M. Zhou. Pixel-Level Double-Step Algorithm for Rasterizing Parametric Curve [J]. Journal of Computer-Aided Design & Computer Graphics. 2002, 14(7): 619-623.

[8] J. Kennedy, R.C. Eberhart. Particle Swarm Optimization [C]. Proceedings of the IEEE International Conference on Neural Networks IV, IEEE computer society, Washington DC, 1995: 1942-(1948).

[9] K.E. Parsopoulos, M.N. Vrahatis. Recent approaches to global optimization problems through particle swarm optimization [J]. Natural Computing, 2002, 1(2-3): 235-306.

[10] C. Grosan, A. Abraham, S.Y. Han, et al. Hybrid particle swarm- evolutionary algorithm for search and optimization [C]. Proceedings of the 4th Mexican International Conference on Artificial Intelligence, Springer-Verlag, London, 2005: 623-632.

DOI: https://doi.org/10.1007/11579427_63

[11] X.Q. Wu, X.L. Han. Extension of Cubic Bézier Curve [J]. Journal of Engineering Graphics, 2005, (6): 98-102.

[12] J. Chen, G.J. Wang. Optimal Parameterizations of the Degree 2 Rational Bézier Curves [J]. Journal of Computer Research and Development, 2008, 45(9): 1601-1604.