Triangular B-splines for blending and filling of polygonal holes
GI '96 Proceedings of the conference on Graphics interface '96
Interactive multi-resolution modeling on arbitrary meshes
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Optimizing 3D triangulations using discrete curvature analysis
Mathematical Methods for Curves and Surfaces
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A finite element method for surface restoration with smooth boundary conditions
Computer Aided Geometric Design
Robust repair of polygonal models
ACM SIGGRAPH 2004 Papers
Fast and robust detection of crest lines on meshes
Proceedings of the 2005 ACM symposium on Solid and physical modeling
FiberMesh: designing freeform surfaces with 3D curves
ACM SIGGRAPH 2007 papers
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Discrete surface modelling using partial differential equations
Computer Aided Geometric Design
Geometric fairing of irregular meshes for free-form surface design
Computer Aided Geometric Design
Fixing geometric errors on polygonal models: a survey
Journal of Computer Science and Technology
Boundary extraction and simplification of a surface defined by a sparse 3D volume
Proceedings of the Third Symposium on Information and Communication Technology
Polygon mesh repairing: An application perspective
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
The paper deals with the problem of remeshing and fairing of undersampled areas (called "holes") in triangular meshes. In this work, we are particularly interested in meshes constructed with geological data but the method can however be applied to any kind of data. With such input data, the point density is often drastically lesser in some regions than in others: this leads to what we call "holes". Once these holes identified, they are filled using a multistep approach. We iteratively: insert vertices in the hole in order to progressively converge towards the density of its neighbourhood, then deform this patch mesh (by minimizing a discrete thin-plate energy) in order to restore the local curvature and guarantee the smoothness of the hole boundary. The main goal of our method is to control both time and space complexity in order to handle huge models while producing quality meshes.