Skinning rational B-spline curves to construct an interpolatory surface

Abstract Skinning is a process by which a set of curves (called generator curves) is interpolated to form a surface. The standard skinning algorithm for polynomial B-spline curves is fairly straightforward and has the desirable property that the created surface is as smooth as the generator curves. Tiller has generalized this algorithm to rational B-spline curves in a way that preserves the simplicity of the algorithm but does not guarantee that the surface will be as smooth as the generator curves. In this paper, we explain how discontinuities can arise, derive the exact conditions under which the surface will be smooth, examine possible modifications to the skinning algorithm, and describe in detail the algorithm that we feel is best.

[1]  A. R. Forrest,et al.  On coons and other methods for the representation of curved surfaces , 1972, Comput. Graph. Image Process..

[2]  C. Woodward.  Skinning techniques for interactive B-spline surface interpolation , 1988 .

[3]  T. Lyche.  Note on the Oslo algorithm , 1988 .

[4]  Daniel J. Filip,et al.  Procedurally representing lofted surfaces , 1989, IEEE Computer Graphics and Applications.

[5]  T. Lyche,et al.  Making the Oslo algorithm more efficient , 1986 .

[6]  Wayne Tiller,et al.  Rational B-Splines for Curve and Surface Representation , 1983, IEEE Computer Graphics and Applications.

[7]  Brian A. Barsky,et al.  Rational continuity: parametric, geometric, and Frenet frame continuity of rational curves , 1989, TOGS.

[8]  Joe Schallan.  VLSI and New Markets Drive CG Developments , 1983, IEEE Computer Graphics and Applications.

[9]  Tom Lyche,et al.  Algorithms for degree-raising of splines , 1985, TOGS.

[10]  L. Piegl,et al.  Curve and surface constructions using rational B-splines , 1987 .

[11]  W. Boehm,et al.  The insertion algorithm , 1985 .

[12]  Hartmut Prautzsch,et al.  Degree elevation of B-spline curves , 1984, Comput. Aided Geom. Des..

[13]  Tom Lyche,et al.  Knot line refinement algorithms for tensor product B-spline surfaces , 1985, Comput. Aided Geom. Des..

[14]  T. Lyche,et al.  A discrete approach to knot removal and degree reduction algorithms for splines , 1987 .

[15]  L. Schumaker,et al.  Degree raising for splines , 1986 .

[16]  T. Lyche,et al.  A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data , 1988 .

[17]  Tom Lyche,et al.  Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .

[18]  Hartmut PRAUTZSCH.  A short proof of the Oslo algorithm , 1984, Comput. Aided Geom. Des..

[19]  Kenneth James Versprille.  Computer-aided design applications of the rational b-spline approximation form. , 1975 .

[20]  W. Boehm.  Inserting New Knots into B-spline Curves , 1980 .

[21]  B. Barsky,et al.  An Introduction to Splines for Use in Computer Graphics and Geometric Modeling , 1987 .

[22]  Wolfgang Böhm.  On the efficiency of knot insertion algorithms , 1985, Comput. Aided Geom. Des..

[23]  G. Farin.  Rational curves and surfaces , 1989 .

[24]  S. A. Coons.  SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMS , 1967 .

[25]  Donald P. Greenberg,et al.  An interactive computer graphics approach to surface representation , 1977, SIGGRAPH '77.

[26]  Knut Mørken,et al.  Knot removal for parametric B-spline curves and surfaces , 1987, Comput. Aided Geom. Des..