Complexity reduction for symbolic computation with rational B-splines

被引:0
|
作者
Chen, Xianming [1 ]
Riesenfeld, Richard F. [1 ]
Cohen, Elaine [1 ]
机构
[1] School of Computing, University of Utah, 50 S. Central Campus Dr., Salt Lake City, UT 84112, United States
来源
International Journal of Shape Modeling | 2007年 / 13卷 / 01期
关键词
Codes (symbols) - Computational complexity - Computational geometry - Logic programming;
D O I
10.1142/S0218654307000932
中图分类号
学科分类号
摘要
Symbolic computation of NURBS plays an important role in many areas of NURBS-based geometric computation and design. However, any nontrivial symbolic computation, especially when rational B-splines are involved, would typically result in B-splines with high degrees. In this paper we develop degree reduction strategies for NURBS symbolic computation on curves. The specific topics we consider include zero curvatures and critical curvatures of plane curves, various ruled surfaces related to space curves, and point/curve bisectors and curve/curve bisectors. © World Scientific Publishing Company.
引用
收藏
页码:25 / 49
相关论文
共 50 条