高级检索
肖文磊, 刘亚醉, Oleksandr Zavalnyi, 赵罡. T-SPLINE开源内核的三层数据结构及算法原理[J]. 计算机辅助设计与图形学学报, 2017, 29(11): 2023-2036.
引用本文: 肖文磊, 刘亚醉, Oleksandr Zavalnyi, 赵罡. T-SPLINE开源内核的三层数据结构及算法原理[J]. 计算机辅助设计与图形学学报, 2017, 29(11): 2023-2036.
Xiao Wenlei, Liu Yazui, Oleksandr Zavalnyi, Zhao Gang. The Three-layer Data Structure of Open Source Kernel T-SPLINE and its Algorithms[J]. Journal of Computer-Aided Design & Computer Graphics, 2017, 29(11): 2023-2036.
Citation: Xiao Wenlei, Liu Yazui, Oleksandr Zavalnyi, Zhao Gang. The Three-layer Data Structure of Open Source Kernel T-SPLINE and its Algorithms[J]. Journal of Computer-Aided Design & Computer Graphics, 2017, 29(11): 2023-2036.

T-SPLINE开源内核的三层数据结构及算法原理

The Three-layer Data Structure of Open Source Kernel T-SPLINE and its Algorithms

  • 摘要: 针对T-SPLINE开源内核,论述了T样条三层数据结构及相关算法原理,以帮助使用者更快更好地掌握和应用T-SPLINE开源内核的使用方法.首先介绍T-SPLINE开源内核及三层数据结构,论述该数据结构对T样条计算与存储的高效性;然后根据三层数据结构的特点设计了一系列高效的算法,主要包括面内节点初始化算法、关键参数抽取算法、高效基函数计算算法、重节点管理算法等,并详细说明了上述算法的原理;最后对T-SPLINE开源内核的时间复杂度和空间复杂度进行了分析与验证.实验证明,T-SPLINE开源内核在时间空间复杂度上具有一定的优势.

     

    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-SPLINE kernel has obvious advantages in space and time complexities.

     

/

返回文章
返回