Mesh repair with user-friendly topology control
Computer-Aided Design
SMI 2011: Full Paper: Geometric models with weigthed topology
Computers and Graphics
Technical Section: Automatic hole-filling of CAD models with feature-preserving
Computers and Graphics
Structure recovery by part assembly
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
A framework for 3D object retrieval algorithm analysis
EG 3DOR'11 Proceedings of the 4th Eurographics conference on 3D Object Retrieval
Polygon mesh repairing: An application perspective
ACM Computing Surveys (CSUR)
Robust inside-outside segmentation using generalized winding numbers
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
An efficient and collision-free hole-filling algorithm for orthodontics
The Visual Computer: International Journal of Computer Graphics
SMI 2013: Steepest descent paths on simplicial meshes of arbitrary dimensions
Computers and Graphics
Consistent volumetric discretizations inside self-intersecting surfaces
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon meshes obtained from acquisition of real-world objects typically exhibit several defects, and thus are not appropriate for a widespread exploitation. In this paper, an algorithm is presented that strives to convert a low-quality digitized polygon mesh to a single manifold and watertight triangle mesh without degenerate or intersecting elements. Differently from most existing approaches that globally resample the model to produce a fixed version, the algorithm presented here attempts to modify the input mesh only locally within the neighborhood of undesired configurations. After having converted the input to a single combinatorial manifold, the algorithm proceeds iteratively by removing growing neighborhoods of undesired elements and by patching the resulting surface gaps until all the “defects" are removed. Though this heuristic approach is not guaranteed to converge, it was tested on more than 400 low-quality models and always succeeded. Furthermore, with respect to similar existing algorithms, it proved to be computationally efficient and produced more accurate results while using fewer triangles.