Surface fitting and numerical gradient computations by discrete mollification
From MaRDI portal
The authors consider the problem of fitting of a surface, which is given only by noisy data (in \(\mathbb{R}^2)\). This is done by a so-called mollification procedure, which is a process of filtering and smoothing the data by a modified convolution process. Many results on the convergence of the method are presented, and also a large number of computed examples is illustrated by a total of 30 figures.
Recommendations
- Discrete mollification and automatic numerical differentiation
- Surface fitting with scattered noisy data on Euclidean D-space and on the sphere
- Surface smoothing with finite elements
- Surface and function approximation with nonparametric regression
- Minimal energy C^r-surfaces on uniform Powell-Sabin-type meshes for noisy data
Cites work
Cited in
(6)- Approximating surfaces by moving total least squares method
- A two dimensional discrete mollification operator and the numerical solution of an inverse source problem
- Approximation methods in the computer numerically controlled fabrication of optical surfaces, Part 2: mollifications
- Computing Surface Uniformization Using Discrete Beltrami Flow
- Automatic numerical solution of generalized 2-D IHCP by discrete mollification
- Piecewise algebraic surface computation and smoothing from a discrete model
This page was built for publication: Surface fitting and numerical gradient computations by discrete mollification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963022)
