0

0

 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.
 发  表:

 共享有4个版本  [展开全部版本] [收起版本] http://dx.doi.org/10.1109/TASE.2009.2021327 http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4967868 http://www.cs.utah.edu/~xchen/papers/multiply-tase.pdf
 Bibtex @MISC{author = {Xianming Chen and Richard F. Riesenfeld and Elaine Cohen},title = {An Algorithm for Direct Multiplication of B-splines},year = {}}

 还没有人点评哦

 Constructing Multiple Kernel Learning Framework for Blast Furnace Automation Computing medial axes of generic 3D regions bounded by B-spline surfaces Nonblocking and Safe Control of Discrete-Event Systems Modeled as Extended Finite Automata Projection and Geodesic-Based Pipe Routing Algorithm Directed Control of Discrete Event Systems for Safety and Nonblocking Sliding windows algorithm for B-spline multiplication Visual-Based Impedance Control of Out-of-Plane Cell Injection Systems Symbolic Computation of Reduced Guards in Supervisory Control An Enhanced Nested Partitions Algorithm Using Solution Value Prediction Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem