Abstract: Boolean operations are fundamental in 3D modeling, as their performance significantly impacts the robustness and efficiency of the modeling process. Current research on Boolean operations for B-Rep models often struggles to achieve a balance between robustness and efficiency. This paper introduces an efficient algorithm for B-Rep Boolean operations. The algorithm leverages a Bounding Volume Hierarchy (BVH), face clustering, and local information near intersection edges to reduce the number of geometric intersection calculations. Additionally, techniques such as intersection graph construction and progressive imprinting are employed to enhance the algorithm's stability. Experimental evaluations using CAD models from real-world scenarios demonstrate that the proposed algorithm offers significant efficiency improvements over OCCT's Boolean operations and achieves performance comparable to that of Parasolid and ACIS in specific scenarios. These results underscore the proposed algorithm as a highly effective solution for Boolean operations on B-Rep models.