一种新的NURBS曲面间最短距离计算的分裂算法

Split Algorithm based on Minimum Distance between NURBS surfaces

碰撞检测是虚拟现实中的一项重要技术,而空间两物体之间的距离计算是碰撞检测问题研究的一个主要方面。本文对非均匀有理B样条(NURBS)曲面间的曲面分裂算法进行了改进,首先插入几何意义较为清楚的控制顶点,反算出要插入的节点,再采用节点插入技术将曲面细分,然后为逐步细分的曲面控制点用增量算法建立凸包围多面体,用求解凸多面体之间的距离的GJK算法代替了包围盒算法,提高了算法的逼近精度和速度。实验结果表明,与现有的Page等提出的算法相比,该算法在效率、精度方面具有明显优势,能够满足交互式复杂虚拟环境的实时性和精确性的要求。

collision detection is the key technology, of VR , and the distance of convex geometric is the important fact of collision detection .The proposed method based upon the technique of splitting the NURBS surfaces . In the algorithm , firstly , the top control points that have clear geometric meaning are inserted , then the inserted nodes are calculated in reverse , and the insert technique is used to divide the curved surfaces finely . then,incremental algorithm for convex hull and GJK algorithm are employed to improve the Spilt Algorithm＇s performance. The implement shows that the improved Spilt Algorithm is more precisely and quickly.