Abstract
We show that many fundamental algorithms and techniques for B-spline curves extend to geometrically continuous splines. The algorithms, which are all related to knot insertion, include recursive evaluation, differentiation, and change of basis. While the algorithms for geometrically continuous splines are not as computationally simple as those for B-spline curves, they share the same general structure. The techniques we investigate include knot insertion, dual functionals, and polar forms; these prove to be useful theoretical tools for studying geometrically continuous splines.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.J. Barry, De Boor-Fix functionals and polar forms, Comp. Aided Geom. Des. 7(1990)425–430.
P.J. Barry, N. Dyn, R.N. Goldman and C.A. Micchelli, Identities for piecewise polynomial spaces determined by connection matrices, Aeq. Math. 42(1991)123–136.
P.J. Barry and R.N. Goldman, Factored knot insertion, in:Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces, ed. T. Lyche and R.N. Goldman (SIAM, Philadelphia, 1993) pp. 65–88.
P.J. Barry and R.N. Goldman, Knot insertion algorithms, in:Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces, ed. T. Lyche and R.N. Goldman (SIAM, Philadelphia, 1993) pp. 89–133.
P.J. Barry and R.-F. Zhu, Another knot insertion algorithm for B-spline curves, Comp. Aided Geom. Des. 9(1992)175–183.
B.A. Barsky and T. DeRose, Geometric continuity of parametric curves: Three equivalent characterizations, IEEE Comp. Graph. Appl. 10(1989)60–68.
W. Boehm, Inserting new knots into B-spline curves, Comp. Aided Des. 12(1980)199–201.
W. Boehm, Efficient evaluation of splines, Computing 33(1984)171–177.
W. Boehm, Curvature, continuous curves and surfaces, Comp. Aided Geom. Des. 2(1985)313–323.
C. de Boor, On calculating with B-splines, J. Approx. Theory 6(1972)50–62.
C. de Boor,A Practical Guide to Splines (Springer, New York, 1978).
C. de Boor and G. Fix, Spline approximation by quasi-interpolants, J. Approx. Theory 8(1976)19–45.
C. de Boor and K. Höllig, B-splines without divided differences, in:Geometric Modeling: Algorithms and New Trends, ed. G. Farin (SIAM, Philadelphia, 1987) pp. 21–27.
P. de Casteljau,Formes à Pôles (Hermes, Paris, 1985).
E. Cohen, T. Lyche and R.F. Riesenfeld, Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics, Comp. Graph. Image Proc. 14(1980)87–111.
M.G. Cox, The numerical evaluation of B-splines, J. Inst. Math. Appl. 10(1972)134–149.
C. Cryer, Some properties of totally positive matrices, Lin. Alg. Appl. 15(1976)1–25.
P. Dierckx and B. Tytgat, Inserting new knots into Beta-spline curves, in:Mathematical Methods in Computer Aided Geometric Design, ed. T. Lyche and L.L. Schumaker (Academic Press, Boston, 1989) pp. 195–205.
N. Dyn and C.A. Micchelli, Piecewise polynomial spaces and geometric continuity of curves, Numer. Math. 54(1988)319–337.
R.N. Goldman, Blossoming and knot insertion algorithms for B-spline curves, Comp. Aided Geom. Des. 7(1990)69–81.
R.N. Goldman and P.J. Barry, Algorithms for progressive curves: Extending B-spline and blossoming techniques to the monomial power, and Newton dual bases, to appear in:Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces, ed. T. Lyche and R.N. Goldman (SIAM, Philadelphia, 1993) pp. 11–64.
R.N. Goldman and P.J. Barry, Wonderful triangle: A simple, unified, algorithmic approach to change of basis procedures in computer aided geometric design, in:Mathematical Methods in Computer Aided Geometric Design II, ed. T. Lyche and L.L. Schumaker (Academic Press, Boston, 1992) pp. 297–320.
T.N.T. Goodman, Properties of Beta-splines, J. Approx. Theory 44(1985)132–153.
T.N.T. Goodman, Constructing piecewise rational curves with Frenet frame continuity, Comp. Aided Geom. Des. 7(1990)15–31.
T.N.T. Goodman, Joining rational curves smoothly, Report AA/902, University of Dundee (1990).
J.A. Gregory, Geometric continuity, in:Mathematical Methods in Computer Aided Geometric Design, ed. T. Lyche and L.L. Schumaker (Academic Press, Boston, 1989) pp. 353–372.
H. Hagen, Geometric spline curves, Comp. Aided Geom. Des. 2(1985)223–227.
B. Joe, Discreteβ-splines,Computer Graphics — Proc. SIGGRAPH'87, 21(4)(1987)137–144.
B. Joe, Knot insertion for Beta-spline curves and surfaces, ACM Trans. Graph. 9(1990)41–65.
S. Karlin,Total Positivity (Stanford University Press, Stanford, CA 1968).
T. Lyche and K. Morken, Making the Oslo algorithm more efficient, SIAM J. Numer. Anal. 23(1986)663–675.
L. Ramshaw, Blossoming: A connect-the-dots approach to splines, Technical Report No. 19, Digital Research Center, Palo Alto, CA (1987).
L. Ramshaw, Blossoms are polar forms, Comp. Aided Geom. Des. 6(1989)323–358.
P. Sablonnière, Spline and Bézier polgons associated with a polynomial spline curve, Comp. Aided Des. 6(1978)257–261.
P.V. Sankar, M.J. Silbermann and L.A. Ferrari, Curve and surface generation and refinement based on a high speed derivative algorithm, submitted for publication.
H.-P. Seidel, Knot insertion from a blossoming point of view, Comp. Aided Geom. Des. 5(1988)81–86.
H.-P. Seidel, A new multiaffine approach to splines, Comp. Aided Geom. Des. 6(1989)23–32.
H.-P. Seidel, Polar forms for geometrically continuous spline curves of arbitrary degree, ACM Trans. Graph. 12(1993)1–34.
M. Spivak,Differential Geometry (Publish or Perish, Inc., Boston, 1975).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barry, P.J., Goldman, R.N. & Micchelli, C.A. Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices. Adv Comput Math 1, 139–171 (1993). https://doi.org/10.1007/BF02071383
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02071383