Abstract: Popular hierarchical bounding boxes methods need split box continuously while getting the intersection of two models, therefore lower their efficiency. Aiming at the problem, by making use of its advantage that can exclude disjoint triangular patches quickly, this paper proposes a more efficient intersection method. It finds the intersection between two models directly to exclude a large number of disjoint triangular patches and gains the intersection lines of two models efficiently.

Key words: triangular mesh, model intersection, hierarchical bounding boxes

摘要： 层次包围盒求交算法在求交过程中需要不断分裂包围盒，从而降低了求交效率。针对上述问题，利用该算法可以快速排除不相交三角面片的优点，提出一种更高效的求交算法，通过直接定位2个求交模型可能相交的部位，高效地排除大量不相交的三角面片，得到 2个模型的交线。

关键词: 三角网格, 模型求交, 层次包围盒

CLC Number: 

• TP301.6