A Robust Algorithm to Remove the Self-intersection of 3D Mesh Data without Changing the Original Shape

Abstract

Self-intersection is a serious problem in computational geometry and digital manufacturing. Because intersected parts do not exist in the physical world, the self-intersection must be removed for actually applications such as 3D printing or CNC machining. In the conventional method, such intersected parts are usually deleted, which causes the change of the original shape. In this research, a robust algorithm to remove the self-intersection of 3D mesh model is proposed. It could automatically detect the self-intersection, and remove the self-intersection without changing the original shape. The proposed algorithm has four steps. (1) Detect the intersected facets in the mesh model. (2) Divide the intersected facets along the crossing lines. (3) Find the outside facets. (4) Delete the inner facets and burying facets. Different models are used to do experiments, and the experimental results prove the validity and practicability of the proposed algorithm.