کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
439558 690802 2013 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Local computation of curve interpolation knots with quadratic precision
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
Local computation of curve interpolation knots with quadratic precision
چکیده انگلیسی

There are several prevailing methods for selecting knots for curve interpolation. A desirable criterion for knot selection is whether the knots can assist an interpolation scheme to achieve the reproduction of polynomial curves of certain degree if the data points to be interpolated are taken from such a curve. For example, if the data points are sampled from an underlying quadratic polynomial curve, one would wish to have the knots selected such that the resulting interpolation curve reproduces the underlying quadratic curve; in this case, the knot selection scheme is said to have quadratic precision. In this paper, we propose a local method for determining knots with quadratic precision. This method improves on our previous method that entails the solution of a global equation to produce a knot sequence with quadratic precision. We show that this new knot selection scheme results in better interpolation error than other existing methods, including the chord-length method, the centripetal method and Foley’s method, which do not possess quadratic precision.


► We propose a new method for determining knots in parametric curve interpolation.
► The knots are computed in a local way.
► The new method has a quadratic precision, so it reproduces a quadratic curve.
► When used in curve construction, the new method produces polynomial curves with higher precision.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer-Aided Design - Volume 45, Issue 4, April 2013, Pages 853–859
نویسندگان
, , , ,