高效改进的雅可比-贝塞尔基变换
Efficient modified Jacobi-Bernstein basis transformations
AI总结:
本文提出一种高效方法,将约束多项式空间中改进的雅可比基与贝塞尔基之间变换复杂度降至O(n²),从而改进了Bézier曲线降阶算法的效率。
摘要:
在本文中,我们证明了在约束多项式空间中,改进的雅可比基与贝塞尔基之间的变换复杂度可达到O(n²)。作为结果,之前在(Bhrawy等人,J. Comput. Appl. Math. 302 (2016), 369--384)中首次提出的Bézier曲线降阶算法,以及随后在(Lu和Xiang,J. Comput. Appl. Math. 315 (2017), 65--69)中修正的算法,其必要的变换复杂度为O(n³),因此可以显著改进。运行时间的比较表明,我们的变换在实践中也更快。
英文摘要:
In the paper, we show that the transformations between modified Jacobi and Bernstein bases of the constrained space of polynomials of degree at most $n$ can be performed with the complexity $O(n^2)$. As a result, the algorithm of degree reduction of Bézier curves that was first presented in (Bhrawy et al., J. Comput. Appl. Math. 302 (2016), 369--384), and then corrected in (Lu and Xiang, J. Comput. Appl. Math. 315 (2017), 65--69), can be significantly improved, since the necessary transformations are done in those papers with the complexity $O(n^3)$. The comparison of running times shows that our transformations are also faster in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。