Abstract
Kjellander has reported an algorithm for fairing uniform parametric cubic splines. Poliakoff extended Kjellander’s algorithm to non-uniform case. However, they merely changed the bad point’s position, and neglected the smoothing of tangent at bad point. In this paper, we present a fairing algorithm that both changed point’s position and its corresponding tangent vector. The new algorithm possesses the minimum property of energy. We also proved Poliakoff’s fairing algorithm is a deduction of our fairing algorithm. Several fairing examples are given in this paper.
Similar content being viewed by others
References
Farin, G., Sapides, N., 1989. Curvature and the fairness of curves and surfaces. IEEE Computer Graphics and Applications, 9(2):52–57. [doi:10.1109/38.19051]
Kjellander, J.A.P., 1983. Smoothing of cubic parametric splines. Computer-Aided Design, 15(3):175–179. [doi:10.1016/0010-4485(83)90085-4]
Lee, E.T.Y., 1990. Energy, fairness, and a counterexample. Computer-Aided Design, 22(1):37–40. [doi:10.1016/0010-4485(90)90027-A]
Li, W., Xu, S., Zheng, J., Zhao, G., 2004. Target curvature driven fairing algorithm for planar B-spline curves. Computer Aided Geometric Design, 21:499–513.
Poliakoff, J.F., 1996. An improved algorithm for automatic fairing of non-uniform parametric cubic splines. Computer-Aided Design, 28(1):59–66. [doi:10.1016/0010-4485(95)00048-8]
Wang, X., Cheng, F., Barsky, B.A., 1997. Energy and B-spline interproximation. Computer-Aided Design, 29(7):485–496. [doi:10.1016/S0010-4485(96)00087-5]
Author information
Authors and Affiliations
Corresponding author
Additional information
Project (No. 10371026) supported by the National Natural Science Foundation of China
Rights and permissions
About this article
Cite this article
Wang, Yj., Cao, Y. Generalized fairing algorithm of parametric cubic splines. J. Zhejiang Univ. - Sci. A 7, 1572–1577 (2006). https://doi.org/10.1631/jzus.2006.A1572
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.2006.A1572