Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Filling gaps in the boundary of a polyhedron
Computer Aided Geometric Design
A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Journal of Global Optimization
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
A robust hole-filling algorithm for triangular mesh
The Visual Computer: International Journal of Computer Graphics
Hole filling in 3D volumetric objects
Pattern Recognition
Differential Evolution: A Survey of the State-of-the-Art
IEEE Transactions on Evolutionary Computation
Hole filling of triangular mesh segments using systematic grey prediction
Computer-Aided Design
Hi-index | 0.00 |
In this work, a new hole patching method (namely as, HPDE) is proposed to repair the damaged or ill-scanned three dimensional objects in real engineering applications. Our method differentiates from other related algorithms mainly on the following three aspects. Firstly, our algorithm sufficiently utilizes the point information around the considered hole for each prediction by constructing point correspondences on both sides of the boundary curve of the hole; secondly, the missing points in the hole region are predicted by the algorithm of differential evolution (DE), which is used to obtain the topological and geometrical structures of the mesh in the hole region; thirdly, operations of mesh optimization are adopted for improving the quality of the obtained triangulation mesh. Numerical results on kinds of holes with complex shape and large curvature, and a comparison with two recently proposed algorithms verify the effectiveness of the algorithm, further experiments on the noisy data points illustrate the robustness of the algorithm against noise.