Interpolation of scattered data in R3 using minimum Lp-norm networks, 1<p<∞
Abstract
We consider the extremal problem of interpolation of scattered data in R3 by smooth curve networks with minimal Lp-norm of the second derivative for 1<p<∞. The problem for p=2 was set and solved by Nielson (1983). Andersson et al. (1995) gave a new proof of Nielson's result by using a different approach. Partial results for the problem for 1<p<∞ were announced without proof in (Vlachkova (1992)). Here we present a complete characterization of the solution for 1<p<∞. Numerical experiments are visualized and presented to illustrate and support our results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.