SCIENCE CHINA Information Sciences, Volume 61, Issue 5: 052104(2018) https://doi.org/10.1007/s11432-017-9134-6

Formula for computing knots with minimum stress and stretching energies

More info
  • ReceivedJan 9, 2017
  • AcceptedMay 10, 2017
  • PublishedSep 1, 2017


Computing knots for a given set of data points in a plane is one of the key steps in the construction of fitting curves with high precision. In this study, a new method is proposed for computing a parameter value (knot) for each data point. With only three adjacent consecutive data points, one may not determine a unique interpolation quadratic polynomial curve, which has one degree of freedom (a variable). To obtain a better curve, the stress and stretching energies are used to optimize this variable so that the quadratic polynomial curve has required properties, which ensure that when the three consecutive points are co-linear, the optimal quadratic polynomial curve constructed is the best. If the position of the mid-point of the three points lies between the first point and the third point, the quadratic polynomial curve becomes a linear polynomial curve. Minimizing the stress and stretching energies is a time-consuming task. To avoid the computation of energy minimization, a new model for simplifying the stress and stretching energies is presented. The new model is an explicit function and is used to compute the knots directly, which greatly reduces the amount of computation. The knots are computed by the new method with minimum stress and stretching energies in the sense that if the knots computed by the new method are used to construct quadratic polynomial, the quadratic polynomial constructed has the minimum stress and stretching energies. Experiments show that the curves constructed using the knots generated by the proposed method result in better interpolation precision than the curves constructed using the knots by the existing methods.


This work was supported by National Natural Science Foundation of China (Grant Nos. 61572292, 61373078), NSFC Joint Fund with Zhejiang Integration of Informatization and Industrialization under Key Project (Grant No. U1609218).


[1] Ahlberg J H, Nilson E N, Walsh J L. The Theory of Splines and Their Applications. New York: Academic Press, 1967. Google Scholar

[2] Boor C. A Practical Guide to Splines. Berlin: Springer, 1978. Google Scholar

[3] Brodie K W. A review of methods for curve and function drawing. In: Mathematical Methods in Computer Graphics and Design. London: Academic Press, 1980. 1--37. Google Scholar

[4] Faux I D, Pratt M J. Computational Geometry for Design and Manufacture. New York: Halsted Press, 1979. Google Scholar

[5] Su B Q, Liu D Y. Computational Geometry. Shanghai: Shang Hai Academic Press, 1982. Google Scholar

[6] Li W, Xu S, Zheng J. Target curvature driven fairing algorithm for planar cubic B-spline curves. Comput Aided Geometric Des, 2004, 21: 499-513 CrossRef Google Scholar

[7] Lü W. Curves with chord length parameterization. Comput Aided Geometric Des, 2009, 26: 342-350 CrossRef Google Scholar

[8] Farin G. Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. London: Academic Press, 1990. Google Scholar

[9] Lee E T Y. Choosing nodes in parametric curve interpolation. Comput-Aided Des, 1989, 21: 363-370 CrossRef Google Scholar

[10] Jeong S Y, Choi Y J, Park P G. Parametric interpolation using sampled data. Comput-Aided Des, 2006, 38: 39-47 CrossRef Google Scholar

[11] Yuksel C, Schaefer S, Keyser J. Parameterization and applications of Catmull-Rom curves. Comput-Aided Des, 2011, 43: 747-755 CrossRef Google Scholar

[12] Fang J J, Hung C L. An improved parameterization method for B-spline curve and surface interpolation. Comput-Aided Des, 2013, 45: 1005-1028 CrossRef Google Scholar

[13] Caiming Zhang , Fuhua (Frank) Cheng , Miura K T. A method for determining knots in parametric curve interpolation. Comput Aided Geometric Des, 1998, 15: 399-416 CrossRef Google Scholar

[14] Zhang C, Wang W, Wang J. Local computation of curve interpolation knots with quadratic precision. Comput-Aided Des, 2013, 45: 853-859 CrossRef Google Scholar

[15] Hartley P J, Judd C J. Parametrization and shape of B-spline curves for CAD. Comput-Aided Des, 1980, 12: 235-238 CrossRef Google Scholar

[16] Marin S P. An approach to data parametrization in parametric cubic spline interpolation problems. J Approximation Theor, 1984, 41: 64-86 CrossRef Google Scholar

[17] Floater M S, Reimers M. Meshless parameterization and surface reconstruction. Comput Aided Geometric Des, 2001, 18: 77-92 CrossRef Google Scholar

[18] Gotsman C. Fundamentals of spherical parameterization for 3d meshes. Acm Trans Graph, 2003, 22: 28--29. Google Scholar

[19] Gu X, Yau S T. Global conformal surface parameterization. In: Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, Aachen, 2003. 127--137. Google Scholar

[20] Xie H, Qin H. A novel optimization approach to the effective computation of nurbs knots. Int J Shape Model, 2011, 7: 199--227. Google Scholar

[21] Bastl B, Jüttler B, Lávi?ka M. Spherical quadratic Bézier triangles with chord length parameterization and tripolar coordinates in space. Comput Aided Geometric Des, 2011, 28: 127-134 CrossRef Google Scholar

[22] Bastl B, Jüttler B, Lávi?ka M. Curves and surfaces with rational chord length parameterization. Comput Aided Geometric Des, 2012, 29: 231-241 CrossRef Google Scholar

[23] Tsuchie S, Okamoto K. High-quality quadratic curve fitting for scanned data of styling design. Comput-Aided Des, 2016, 71: 39-50 CrossRef Google Scholar

[24] Han X. A class of general quartic spline curves with shape parameters. Comput Aided Geometric Des, 2011, 28: 151-163 CrossRef Google Scholar

[25] Antonelli M, Beccari C V, Casciola G. High quality local interpolation by composite parametric surfaces. Comput Aided Geometric Des, 2016, 46: 103-124 CrossRef Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有