T-SPLINE开源内核的三层数据结构及算法原理-计算机辅助设计与图形.PDFVIP

29 11 Vol.29 No.11 2017 11 Journal of Computer-Aided Design Computer Graphics Nov. 2017 T-SPLINE 开源内核的三层数据结构及算法原理 1,2) 1) 1) 1,2)* 肖文磊 , 刘亚醉 , Oleksandr Zavalnyi , 赵 罡 1) (北京航空航天大学机械工程及自动化学院 北京 100191) 2) (北京航空航天大学工信部航空智能制造重点实验室 北京 100191) (zhaog@) : 针对T-SPLINE 开源内核, 论述了T 样条三层数据结构及相关算法原理, 以帮助使用者更快更好地掌握和应 用T-SPLINE 开源内核的使用方法. 首先介绍T-SPLINE 开源内核及三层数据结构, 论述该数据结构对T 样条计算与 存储的高效性; 然后根据三层数据结构的特点设计了一系列高效的算法, 主要包括面内节点初始化算法、关键参数抽 取算法、高效基函数计算算法、重节点管理算法等, 并详细说明了上述算法的原理; 最后对T-SPLINE 开源内核的时 间复杂度和空间复杂度进行了分析与验证. 实验证明, T-SPLINE 开源内核在时间空间复杂度上具有一定的优势. : T 样条; 开源内核; 三层数据结构 : TP391.7 The Three-layer Data Structure of Open Source Kernel T-SPLINE and its Algorithms Xiao Wenlei1,2), Liu Yazui1), Oleksandr Zavalnyi1), and Zhao Gang1,2)* 1) (School of Mechanical Engineering and Automation, Beihang University, Beijing 100191) 2) (MIIT Key Laboratory of Aeronautics Intelligent Manufacturing, Beihang University, Beijing 100191) Abstract: This paper introduces the three-layer data structure and correlative algorithms of the open source kernel T-SPLINE, so as to facilitate the application for global users. Firstly, the fundamentals of T-SPLINE open source kernel and its three-layer data structure are introduced, which brings significant efficiency in computing and storing. Secondly, a set of efficient algorithms are designed according to the three-layer data structure, such as the face-oriented knots initialization, the extraction of critical parameters, efficient basis functions, the management of multiple knots, etc. Finally, some examples are tested to analyze and verify the space and time complexities. Experimental results show that the efficiency of the T-S