An Algorithm for Direct Multiplication of B-Splines

B-spline multiplication, that is, finding the coefficients of the product B-spline of two given B-splines is useful as an end result, in addition to being an important prerequisite component to many other symbolic computation operations on B-splines. Algorithms for B-spline multiplication standardly use indirect approaches such as nodal interpolation or computing the product of each set of polynomial pieces using various bases. The original direct approach is complicated. B-spline blossoming provides another direct approach that can be straightforwardly translated from mathematical equation to implementation; however, the algorithm does not scale well with degree or dimension of the subject tensor product B-splines. To addresses the difficulties mentioned heretofore, we present the sliding windows algorithm (SWA), a new blossoming based algorithm for the multiplication of two B-spline curves, two B-spline surfaces, or any two general multivariate B-splines.

[1]  Tony DeRose,et al.  A Tutorial Introduction to Blossoming , 1991 .

[2]  Hans-Peter Seidel,et al.  An introduction to polar forms , 1993, IEEE Computer Graphics and Applications.

[3]  Xianming Chen,et al.  An Application of Singularity Theory to Robust Geometric Calculation of Interactions Among Dynamically Deforming Geometric Objects , 2008 .

[4]  Xianming Chen,et al.  Sliding windows algorithm for B-spline multiplication , 2007, Symposium on Solid and Physical Modeling.

[5]  Ron Goldman,et al.  Functional composition algorithms via blossoming , 1993, TOGS.

[6]  Lyle Ramshaw,et al.  Blossoms are polar forms , 1989, Comput. Aided Geom. Des..

[7]  Gershon Elber,et al.  Geometric constraint solver using multivariate rational spline functions , 2001, SMA '01.

[8]  Kenji Ueda,et al.  Multiplication as a general operation for splines , 1994 .

[9]  Gershon Elber,et al.  Second-order surface analysis using hybrid symbolic and numeric operators , 1993, TOGS.

[10]  Les A. Piegl,et al.  Symbolic operators for NURBS , 1997, Comput. Aided Des..

[11]  Gershon Elber,et al.  Geometric modeling with splines - an introduction , 2001 .

[12]  Carl de Boor,et al.  A Practical Guide to Splines , 1978, Applied Mathematical Sciences.

[13]  Gershon Elber,et al.  A unified approach to verification in 5-axis freeform milling environments , 1999, Comput. Aided Des..

[14]  Gershon Elber,et al.  Trimming local and global self-intersections in offset curves/surfaces using distance maps , 2006, Comput. Aided Des..

[15]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[16]  Gershon Elber,et al.  A computational model for nonrational bisector surfaces: curve-surface and surface-surface bisectors , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[17]  Xianming Chen,et al.  Theoretically-based algorithms for robustly tracking intersection curves of deforming surfaces , 2007, Comput. Aided Des..

[18]  E. T. Y. Lee,et al.  Computing a chain of blossoms, with application to products of splines , 1994, Comput. Aided Geom. Des..

[19]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[20]  K. Mørken.  Some identities for products and degree raising of splines , 1991 .

[21]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[22]  Gershon Elber,et al.  Mold Accessibility via Gauss Map Analysis , 2005, J. Comput. Inf. Sci. Eng..

[23]  Michael S. Blum.  Modeling the Film Hierarchy in Computer Animation Final Reading Approval Approved for the Major Department , 1992 .

[24]  David Thomas,et al.  The Art in Computer Programming , 2001 .