Abstract
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 is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahlberg J H, Nilson E N, Walsh J L. The Theory of Splines and Their Applications. New York: Academic Press, 1967
Boor C. A Practical Guide to Splines. Berlin: Springer, 1978
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
Faux I D, Pratt M J. Computational Geometry for Design and Manufacture. New York: Halsted Press, 1979
Su B Q, Liu D Y. Computational Geometry. Shanghai: Shang Hai Academic Press, 1982
Zhao G, Li W, Zheng J, et al. Target curvature driven fairing algorithm for planar cubic b-spline curves. Comput Aid Geom Des, 2004, 21: 499–513
Lü W. Curves with chord length parameterization. Comput Aid Geom Des, 2009, 26: 342–350
Farin G. Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. London: Academic Press, 1990
Lee E. Choosing knots in parametric curve interpolation. Comput Aid Des, 1989, 21: 363–370
Jeong S Y, Yun J C, Park P G. Parametric interpolation using sampled data. Comput Aid Des, 2006, 38: 39–47
Yuksel C, Schaefer S, Keyser J. Parameterization and applications of catmull-rom curves. Comput Aid Des, 2011, 43: 747–755
Fang J J, Hung C L. An improved parameterization method for b-spline curve and surface interpolation. Comput Aid Des, 2013, 45: 1005–1028
Zhang C, Cheng F, Miura K T. A method for determining knots in parametric curve interpolation. Comput Aid Geom Des, 1998, 15: 399–416
Zhang C, Wang W, Wang J, et al. Local computation of curve interpolation knots with quadratic precision. Comput Aid Des, 2013, 45: 853–859
Hartley P J, Judd C J. Parametrization and shape of b-spline curves for cad. Comput Aid Des, 1980, 12: 235–238
Marin S P. An approach to data parametrization in parametric cubic spline interpolation problems. J Approx Theory, 1984, 41: 64–86
Floater M S, Reimers M. Meshless parameterization and surface reconstruction. Comput Aid Geom Des, 2001, 18: 77–92
Gotsman C. Fundamentals of spherical parameterization for 3d meshes. Acm Trans Graph, 2003, 22: 28–29
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
Xie H, Qin H. A novel optimization approach to the effective computation of nurbs knots. Int J Shape Model, 2011, 7: 199–227
Bastl B, Juettler B, Lavicka M. Spherical quadratic bézier triangles with chord length parameterization and tripolar coordinates in space. Comput Aid Geom Des, 2011, 28: 127–134
Bastl B, Juettler B, Lavicka M. Curves and surfaces with rational chord length parameterization. Comput Aid Geom Des, 2012, 29: 231–241
Tsuchie S, Okamoto K. High-quality quadratic curve fitting for scanned data of styling design. Comput Aid Des, 2016, 71: 39–50
Han X. A class of general quartic spline curves with shape parameters. Comput Aid Geom Des, 2011, 28: 151–163
Antonelli M, Beccari C V, Casciola G. High quality local interpolation by composite parametric surfaces. Comput Aid Geom Des, 2016, 46: 103–124
Acknowledgments
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).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, X., Zhang, F., Chen, G. et al. Formula for computing knots with minimum stress and stretching energies. Sci. China Inf. Sci. 61, 052104 (2017). https://doi.org/10.1007/s11432-017-9134-6
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-017-9134-6