An Efficient Algorithm for Degree Reduction of MD-Splines

This paper analyzes the computational time complexity of the previously proposed methods for constructing dual basis functions. It presents a method that employs discrete numerical summation for computing the integral of a polynomial, enabling rapid calculation of the inner product of two polynomial functions. Building on this approach, an algorithm is obtained to address the degree reduction problem for MD-spline curves. It efficiently computes the control points after degree reduction, ensuring the least square approximation.