Multistage trivariate surfaces
The paper discusses interpolants to arbitrarily spaced data in 3 or more dimensions. A multistage method is defined by the following procedure: (1) interpolate to the arbitrarily placed data with a general method, (2) then evaluate this general method over a coarse rectilinear grid to provide data for a tensor product method, and (3) render the surface by evaluating the tensor product over a fine grid. The rationale for algorithms like this is the fact that interpolants from step 1 may be expensive to compute for large data sets (as are often needed for rendering). Thus a reasonably small number is extracted from 1 to produce a cheap surface 2.
- Surfaces in computer aided geometric design: A survey with new results
- Scattered data interpolation and approximation with error bounds
- Interpolation and approximation of 3-D and 4-D scattered data
- C^ 1 trivariate polynomial interpolation
- A two-stage filter for smoothing multivariate noisy data on unstructured grids
- scientific article; zbMATH DE number 1209391 (Why is no real title available?)
- Multiquadric and its shape parameter -- a numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Theory and applications of the multiquadric-biharmonic method. 20 years of discovery 1968-1988
- Three- and four-dimensional surfaces
- Surfaces over Dirichlet tessellations
This page was built for publication: Multistage trivariate surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801628)
