Boolean Operations on Polygonal Meshes Using OBB Trees

Abstract

Algorithms for Boolean operations using BSP trees and other algorithms have problems with efficiency and robustness. In order to improve the speed and correctness of operations, a new algorithm for Boolean operations on polygonal meshes was presented. In this algorithm, a fast collision detection algorithm based on oriented bounding box (OBB) was employed, which speed up the intersection test between every two triangles of two different polygonal meshes. After getting the intersection segments, the polygons can be obtained from intersected triangles and intersection segments, then establish the intersection region. Finally, the ultimate result was obtained by acceptance or rejection for the other meshes based on intersection region and the neighborhood of these meshes. In this algorithm, orientability, topology and other geometric characteristics are made full use of. The result shows that the algorithm is efficient and robust. Furthermore, it can apply to both closed meshes and open meshes.