基于层次包围盒与平均单元格的三角网格求交  

Triangle mesh surface intersection based on bounding volume hierarchy and uniform grid

作　　者：寿华好[1] 周超 SHOU Huahao;ZHOU Chao(College of Science,Zhejiang University of Technology,Hangzhou 310023,China)

机构地区：[1]浙江工业大学理学院,浙江杭州310023

出　　处：《浙江工业大学学报》2018年第5期540-543,557,共5页Journal of Zhejiang University of Technology

基　　金：国家自然科学基金资助项目(61572430)

摘　　要：层次包围盒法,通过在求交过程中对模型包围盒地不断划分,最终筛选掉大量不相交的三角面片.平均单元格法,对求交模型进行预处理,以加快相交元素对的获取.综合两种方法的各自优势,提出一种混合的求交算法,对两个模型分别创建各自包围盒,进行层次包围盒法,粗略地排除不相交的三角形;再采用平均单元格法,将相交的三角形准确地定位到各个单元格内.实验结果表明:该算法速度远远大于层次包围盒法,与平均单元格法的速度大致相当,但是消耗的内存却大大减少,使得该方法更适用于巨大的模型场景.The Bounding Volume Hierarchy method,through continuous splitting of the bounding box model,finally a lot of disjoint triangles are filtered out in the process of intersection.Uniform Grid method is used to preprocess the intersection model,so as to speed up the acquisition of intersecting elements.Combining the advantages of the two methods,a hybrid intersection algorithm is proposed.We create two bounding boxes which belong to the two models respectively,and the bounding box method is used to roughly exclude the disjoint triangles;then the uniform grid method is used to locate the intersecting triangles accurately in each cell.The experimental results show that the algorithm speed is much faster than that of the Bounding Volume Hierarchy method,the same as that of the Uniform Grid,but the memory consumption is greatly reduced,which makes the method more suitable for large scene model.

关 键 词：层次包围盒法 平均单元格法 求交 

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