直线与高精度细分曲面交点快速计算方法  

An efficient algorithm for computing intersection between line and high precision subdivision surface

作　　者：朱建宁[1] 王敏杰[1] 魏兆成[1] 曹斌[1] 

机构地区：[1]大连理工大学机械工程学院,辽宁大连116024

出　　处：《大连理工大学学报》2013年第3期376-381,共6页Journal of Dalian University of Technology

摘　　要：为解决直线与高精度细分曲面求交效率低和稳定性差的问题,利用细分曲面网格拓扑结构特性,研究直线与Catmull-Clark细分曲面求交的高效方法.首先,构造一个新的数据结构,实现Catmull-Clark细分曲面的分片表示.然后,对每个细分曲面面片创建轴对称包围盒,结合包围盒干涉检测技术,快速排除不与直线相交的细分曲面面片,根据细分曲面面片网格拓扑结构特性,提出细分曲面面片多级分割技术.最后,通过一定级别的分割并结合轴对称包围盒干涉检测技术,快速锁定与直线相交的四边形面片并获得交点.To solve the problem of inefficiency and poor stability in computing intersection between line and high precision subdivision surface, an efficient method is presented for computing intersection between line and Catmull-Clark subdivision surface by utilizing topological characteristics of subdivision surface. Firstly, a new data structure is constructed for piecewise representation of Catmull-Clark subdivision surface. Then, an axis aligned bounding box （AABB） is created for each subdivision surface patch. Based on AABB collision detection technology, subdivision surface patches non-intersecting the line can be eliminated rapidly. Subdivision surface patch multi-segmentation technology is presented on the basis of topological characteristics of subdivision surface patch. Lastly, quadrilateral face intersecting the line can be determined and intersection point can be obtained by combination of multi-segmentation and AABB collision detection technology.

关 键 词：直线与细分曲面求交 数据结构 分治策略 多级分割 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]