Exact boolean operation on triangulated meshes using accelerated BSPs

We propose an accelerated BSPs for fast and efficient handling of Boolean operations on triangulated mesh models. We conduct a two-stage selection of hyperplanes strategy to construct data structure, so that the BSP tree converge fastly and perform good partitioning results. To constrain the complexity of BSP, the data structure of BSP tree is maintained during the iterations to hasten calculation globally. Fixed-precision operations are used in the algorithm. We have carried out preliminary validation on cylindrical, spherical and ellipsoidal meshes and obtained better filtered results, which can effectively reduce the number of triangular surfaces judged to intersect.