Smooth, easy to compute interpolating splines

32Citations
Citations of this article
238Readers
Mendeley users who have this article in their library.

Abstract

We present a system of interpolating splines with first-order and approximate second-order geometric continuity. The curves are easily computed in linear time by solving a diagonally dominant, tridiagonal system of linear equations. 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 translation, rotation, and scaling, 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 cubics. 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. © 1986 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Hobby, J. D. (1986). Smooth, easy to compute interpolating splines. Discrete & Computational Geometry, 1(1), 123–140. https://doi.org/10.1007/BF02187690

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free