C-B样条细分的新算法  

The New Algorithm of C-B Spline Subdivision

作　　者：王铭君[1] 

机构地区：[1]哈尔滨理工大学应用科学学院,黑龙江哈尔滨150080

出　　处：《哈尔滨理工大学学报》2014年第5期40-42,49,共4页Journal of Harbin University of Science and Technology

摘　　要：提出了一种基于C-B样条的C-C细分自适应算法,该算法通过比较网格顶点的距离来实现自适应过程.自适应算法通过计算新顶点与极限顶点的距离D值,比较D和规定的阈值ω大小,得出可继续细分与不可继续细分的点、边和面.避免了细分过程中细分网格的快速增加,大大减少计算量与存储空间,并得到了与原算法具有同样光顺性的极限曲面.An adaptive algorithm for the subdivision based on C-B spline is proposed in this paper.This algorithm is achieved by comparing the distance between grid vertices.By calculating the distance D between the new vertex and extreme vertex,then comparing measurement of D and the required threshold ω,the adaptive algorithm can find out the point,line and surface can be divided and not can be divided.The algorithm in this paper also avoids the subdivision grid increase rapidly in subdivision process,reduces the computation and storage space,and obtains the limit surface has the same smoothness with the original algorithm.

关 键 词：自适应算法 细分网格 光顺性 

分 类 号：O29[理学—应用数学]