Extremal interpolation of convex scattered data in R^3 by smooth edge convex minimum L_-norm networks: characterization and solution
From MaRDI portal
Publication:6941204
Cites work
- A Method for Interpolating Scattered Data Based Upon a Minimum Norm Network
- A Newton-type algorithm for solving an extremal contrained interpolation problem
- Advances in scattered data interpolation
- Constrained \(L_ p\) approximation
- Curve and Surface Reconstruction
- Delaunay triangulation based surface reconstruction
- scientific article; zbMATH DE number 3882942 (Why is no real title available?)
- scientific article; zbMATH DE number 409745 (Why is no real title available?)
- Interpolation by smooth functions under restrictions on the derivatives
- Interpolation of convex scattered data in R^ 3 based upon an edge convex minimum norm network
- Interpolation of scattered data in \(\mathbb{R}^3\) using minimum \(L_p\)-norm networks, \(1 < p < \infty \)
- Multilevel interpolation of scattered data using \(\mathcal{H}\)-matrices
- On 'best' interpolation
- Polyharmonic splines interpolation on scattered data in 2D and 3D with applications
- Scattered data interpolation by Shepard's like methods: classical results and recent advances
This page was built for publication: Extremal interpolation of convex scattered data in \(\mathbb{R}^3\) by smooth edge convex minimum \(L_\infty\)-norm networks: characterization and solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941204)