A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
An End-to-End Geometric Deficiencies Elimination Algorithm for 3D Meshes
2020 35th Youth Academic Annual Conference of Chinese Association of Automation (YAC)
The 3D mesh is an important representation of geometric data. In the generation of mesh data, geometric deficiencies (e.g., duplicate elements, degenerate faces, isolated vertices, self-intersection, and inner faces) are unavoidable and may violate the topology structure of an object. In this paper, we propose an effective and efficient geometric deficiency elimination algorithm for 3D meshes. Specifically, duplicate elements can be eliminated by assessing the occurrence times of vertices ordoi:10.1109/yac51587.2020.9337658 fatcat:lnd47r4xwjff5pemkdynw3rvyu