An end-to-end geometric deficiencies elimination algorithm for 3D meshes

The 3D mesh is an important representation of geometric data. It is widely used in computer graphics and has attracted more attention in computer vision community recently. However, in the generation of mesh data, geometric deficiencies (e.g., duplicate elements, degenerate faces, isolated vertices, self-intersection, and inner faces) are unavoidable. Geometric deficiencies may violate the topology structure of an object and affect the use of 3D meshes. In this paper, we propose an end-to-end algorithm to eliminate geometric deficiencies effectively and efficiently for 3D meshes in a specific and reasonable order. Specifically, duplicate elements can be first eliminated by assessing appear times of vertices or faces. Then, degenerate faces can be removed according to the outer product of two edges. Next, since isolated vertices do not appear in any face vertices, they can be deleted directly. Afterward, self-intersecting faces are detected and remeshed by using an AABB tree. Finally, we detect and remove an inner face according to whether multiple random rays shooted from a face can reach infinity. Experiments on ModelNet40 dataset illustrate that our method can eliminate the deficiencies of 3D meshes thoroughly.