摘要
三角网格模型间的求交问题是计算机辅助设计与制造领域的关键问题之一。分析了已有空间分解技术和包围盒方法等的优缺点,并在此基础上提出了改进的空间分解求交方法。该算法能够精确定位三角形所占的空间网格,一定程度上减少了需要求交的三角形的数量。实验的结果表明,改进的算法提高了采用空间分解进行三角网格求交的计算效率。
The intersection problem between triangular mesh models is one of the key issues in the field of CAD/CAM. The authors analyzed the advantages and disadvantages of the existing space division technology and bounding boxes method, and then proposed an improved space division algorithm. This method can more precisely locate space grids that the triangular facets occupy. As a result, it decreases the number of triangular facets that need intersecting calculation. Experiments show that the new method can improve the efficiency of computing triangular mesh intersections based on space division.
出处
《计算机应用》
CSCD
北大核心
2009年第10期2671-2673,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(60807036)
关键词
三角网格模型
求交
空间分解
包围盒
triangular mesh model
computing intersection
space division
bounding box
