Free-form shape design using triangulated surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Parametrization and smooth approximation of surface triangulations
Computer Aided Geometric Design
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
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Blending Surfaces with Minimal Curvature
Graphics and Robotics
Geometric fairing of irregular meshes for free-form surface design
Computer Aided Geometric Design
On harmonic and biharmonic Bézier surfaces
Computer Aided Geometric Design
PDE triangular Bézier surfaces: Harmonic, biharmonic and isotropic surfaces
Journal of Computational and Applied Mathematics
A level-set method for skinning animated particle data
SCA '11 Proceedings of the 2011 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
| Hi-index | 0.00 |
Algorithms to create fair meshes can be divide d into two categories, depending on whether they are linear or nonlinear. Linear methods have the advantage of being fast, robust and easy to implement, but the results depend highly on the chosen parameterization strategy. Nonlinear methods usually are based on intrinsic surface properties that only depend on the surface geometry and hence lead to surfaces that show high quality fairness and are free from parameterization artifacts. But such methods are considerably slower, more involved to implement, and their convergence depends on the quality of the initial surface that is used in the iterative constructive process. In this paper we present a nonlinear mesh fairing algorithm enabling G1 boundary conditions that lies between the linear and completely intrinsic methods, leading to a construction process that has many advantages of the linear approach while producing a mesh quality that is superior to the results of strictly linear methods.