Through a precise recursion of B-spline bases, this paper presents an efficient algorithm for the calculation of NURBS curves and all their derivatives. The algorithm requires less storage and is proved to be stable.
Through a precise recursion of B-spline bases and the resursive expression of the derivatives of rational surfaces, this paper presents an efficient algorithm for the calculation of NURBS surfaces and all their direct...Through a precise recursion of B-spline bases and the resursive expression of the derivatives of rational surfaces, this paper presents an efficient algorithm for the calculation of NURBS surfaces and all their directional derivatives. The algorithm requires less storage and proves to be stable.展开更多
In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to ...In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence and smoothness of the proposed schemes, the Laurent polynomial method has been used.展开更多
文摘Through a precise recursion of B-spline bases, this paper presents an efficient algorithm for the calculation of NURBS curves and all their derivatives. The algorithm requires less storage and is proved to be stable.
基金Supported by National Science Foundation of China,China Postdoctral Science Foundation863 projects。
文摘Through a precise recursion of B-spline bases and the resursive expression of the derivatives of rational surfaces, this paper presents an efficient algorithm for the calculation of NURBS surfaces and all their directional derivatives. The algorithm requires less storage and proves to be stable.
文摘In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence and smoothness of the proposed schemes, the Laurent polynomial method has been used.
