| NURBS求交算法—曲面部分 |
| |
| 引用本文： | 姜寿山,刘雄伟.NURBS求交算法—曲面部分[J].西安工业学院学报,1993,13(1):6-14. |
| |
| 作者姓名： | 姜寿山 刘雄伟 |
| |
| 作者单位： | 西安工业学院，西北工业大学 |
| |
| 摘 要： | NURBS曲面的R-cube求交算法通过改变曲面凸包的形状而使得曲面与其凸包贴得更近,从而减少求交过程中的曲面细分次数,提高计算速度。当曲面细分到足够小时,用双线性插值曲面片代替一般的小平面片求出近似交线,提高了求交精度。文中给出具体的实现过程、流程图和实例。经实用系统的验证,这种求交算法具有稳定、可靠、速度快和精度高的特点。
|
| 关 键 词： | 凸包 求交 NURBS曲面 B样条 |
INTERSECTION ALGORITHM FOR NURBS SURFACES |
| |
| Jiang Shoushan Liu Xiongwei.INTERSECTION ALGORITHM FOR NURBS SURFACES[J].Journal of Xi'an Institute of Technology,1993,13(1):6-14. |
| |
| Authors: | Jiang Shoushan Liu Xiongwei |
| |
| Affiliation: | Jiang Shoushan Liu Xiongwei |
| |
| Abstract: | R-cube intersection algorithm for NURBSsurfaces presented in the paper at first adopts rotated cube as the convex-box of the NURBS surface to make the convex-box and the surface closer. Bilinear interpolation patches instead of planar patches are used to solve the approximation intersection curve, when the surface patches are enough small. As a result, the surface sub-division number during the intersection is greatly reduced and the approximation precision is increased. The concrete realizing process is described and the flow diagram is illustrated. Compared with other convex-box algorithms for NURBS surfaces, R-cube algorithm is not only stable, reliable but also |
| |
| Keywords: | B-splines convex-hulls intersection NURBS surface |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
