首页 | 本学科首页   官方微博 | 高级检索  
     

基于NURBS曲面间的最短距离分裂算法的研究
引用本文:赵伟,牛兰平,张炯迨,丁文宝,夏嘉忆. 基于NURBS曲面间的最短距离分裂算法的研究[J]. 吉林工学院学报, 2008, 29(5): 481-485
作者姓名:赵伟  牛兰平  张炯迨  丁文宝  夏嘉忆
作者单位:长春工业大学计算机科学与工程学院,吉林长春130012
基金项目:国家自然科学基金项目(60573182,69883004)
摘    要:针对非均匀有理B样条(NURBS)曲面间的曲面分裂算法进行了改进。首先插入几何意义较为清楚的控制顶点,反算出要插入的节点,再采用节点插入技术将曲面细分,然后为逐步细分的曲面控制点用增量算法建立凸包围多面体,用求解凸多面体之间的距离的GJK算法代替了包围盒算法,并且使用“一致代价搜索法”的思想改进搜索算法,提高了算法的逼近精度和速度。

关 键 词:NURBS曲面  曲面分裂  凸包  GJK算法

Minimum distance split algorithm based on NURBS interface
ZHAO Wei,NIU Lan-ping,ZHANG Jiong-dai,DING Wen-bao,XIA Jia-yi. Minimum distance split algorithm based on NURBS interface[J]. Journal of Jilin Institute of Technology, 2008, 29(5): 481-485
Authors:ZHAO Wei  NIU Lan-ping  ZHANG Jiong-dai  DING Wen-bao  XIA Jia-yi
Affiliation:School of Computer Application Technology;Changchun University of Technology;Changchun 130012;China
Abstract:We improve the surface split algorithm for NURBS surfaces.First,the clearly geometric control vertexes are inserted,and then the inserted nodes are calculated out.The surface is fractionized with the insert technique and then the convex hull polyhedrons are established with the incremental algorithm for the control vertexes in the fractionized surface.The encircle-box algorithm to get the distance among the convex polyhedrons is replaced by GJK algorithm,and the uniform-cost search is applied to improve the...
Keywords:NURBS surfaces  spilt of NURBS surfaces  convex hull  GJK algorithm.  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号