Smooth, Easy to Computer Interpolating Splines
نویسنده
چکیده
We present a system of interpolating splines with first and approximate second order geometric continuity. The curves are easily computed in linear time by solving a system of linear equations without the need to resort to any kind of successive approximation scheme. Emphasis is placed on the need to find aesthetically pleasing curves in a wide range of circumstances; favorable results are obtained even when the knots are very unequally spaced or widely separated. The curves are invariant under scaling, rotation, and reflection, and the effects of a local change fall off exponentially as one moves away from the disturbed knot. ’ Approximate second order continuity is achieved by using a linear “mock curvature” function in place of the actual endpoint curvature for each spline segment and choosing tangent directions at knots so as to equalize these. This avoids extraneous solutions and other forms of undesirable behavior without seriously compromising the quality of the results. The actual spline segments can come from any family of curves whose endpoint curvatures can be suitably approximated, but we propose a specific family of parametric cubits. There is freedom to allow tangent directions and “tension” parameters to be specified at knots, and special “curl” parameters may be given for additional control near the endpoints of open curves. This rcsc<arch was supported in part by the National Scicncc F’oundation under gr,ults IST-820-1926 and MCS-83-00984 and by the Systems Dcvclopmcnt I?oundation.
منابع مشابه
Volume Data Interpolation using Tensor Products of Spherical and Radial Splines
Trivariate splines solve a special case of scattered data interpolation problem in the volume bounded by two concentric spheres. A triangulation ∆ of the unit sphere S is constructed based on the vertex set V. Given a partition P of the interval [1, R], let Sτ×ρ σ×δ be the space of the spherical splines of degree σ and smoothness τ over ∆ tensored with the univariate radial splines of degree δ ...
متن کاملIF Approximation of Fourier Transforms and Certain Interpolating Splines
We extend to iP, X g p < °°, the L2 results of Bramble and Hilbert on convergence of discrete Fourier transforms and on approximation using smooth splines. The main tools are the estimates of [ 1 ] for linear functionals on Sobolev spaces and elementary results on Fourier multipliers.
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملAlternatives to the Exponential Spline in Tension
A general setting is given for smooth interpolating splines depending on a parameter such that as this parameter approaches infinity the spline converges to the piecewise linear interpolant. The theory includes the standard exponential spline in tension, a rational spline, and several cubic splines. An algorithm is given for one of the cubics; the parameter for this example controls the spacing...
متن کاملSpline Animator: Smooth Camera Motion for AVS Animation
This paper introduces the Spline Animator module, which facilitates the use of smooth camera motion in AVS animations. In particular, the module features a highly intuitive interface which allows the user to deene a set of keyframes determining the resulting camera path. The module then generates smooth camera motion by interpolating these keyframes with uniform cubic splines. The functionality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 1 شماره
صفحات -
تاریخ انتشار 1986