Abstract
Methods for interpolating and approximating three-dimensional scattered data are presented. These methods consist of several local least squares approximations, followed by a piecewise bicubic Hermite interpolant to gridded data, and then optionally followed by a modified Shepard's method. Error bounds are derived for the interpolation and approximation methods that depend on the maximum distance from the nearest data point. The visual smoothness and the discrete errors for these methods applied to known functional data compare favorably with other methods in the literature. The storage and computational complexities of these methods are linear in the number of data points.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
