Abstract
As specified by Little [7], the triangular Shepard method can be generalized to higher dimensions and to set of more than three points. In line with this idea, the hexagonal Shepard method has been recently introduced by combining six-points basis functions with quadratic Lagrange polynomials interpolating on these points and the error of approximation has been carried out by adapting, to the case of six points, the technique developed in [4]. As for the triangular Shepard method, the use of appropriate set of six-points is crucial both for the accuracy and the computational cost of the hexagonal Shepard method. In this paper we discuss about some algorithm to find useful six-tuple of points in a fast manner without the use of any triangulation of the nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cavoretto, R., De Rossi, A., Dell’Accio, F., Di Tommaso, F.: Fast computation of triangular Shepard interpolants. J. Comput. Appl. Math. 354, 457–470 (2019)
Cavoretto, R., De Rossi, A., Perracchione, E.: Efficient computation of partition of unity interpolants through a block-based searching technique. Comput. Math. Appl. 71(12), 2568–2584 (2016)
Dalík, J.: Optimal-order quadratic interpolation in vertices of unstructured triangulations. Appl. Math. 53(6), 547–560 (2008)
Dell’Accio, F., Di Tommaso, F., Hormann, K.: On the approximation order of triangular Shepard interpolation. IMA J. Numer. Anal. 36, 359–379 (2016)
Dell’Accio, F., Di Tommaso, F.: Scattered data interpolation by Shepard’s like methods: classical results and recent advances. Dolomites Res. Notes Approx. 9, 32–44 (2016)
Dell’Accio, F., Di Tommaso, F.: On the hexagonal Shepard method. Appl. Numer. Math. 150, 51–64 (2020). https://doi.org/10.1016/j.apnum.2019.09.005. ISSN 0168-9274
Little, F.: Convex combination surfaces. In: Barnhill, R.E., Boehm, W. (eds.) Surfaces in Computer Aided Geometric Design, North-Holland, vol. 1479, pp. 99–108 (1983)
Renka, R.J.: Algorithm 790: CSHEP2D: cubic shepard method for bivariate interpolation of scattered data. ACM Trans. Math. Softw. 25(1), 70–73 (1999)
Acknowledgments
This work was partially supported by the INdAM-GNCS 2019 research project “Kernel-based approximation, multiresolution and subdivision methods and related applications”. This research has been accomplished within RITA (Research ITalian network on Approximation).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Dell’Accio, F., Di Tommaso, F. (2020). Interpolation by Bivariate Quadratic Polynomials and Applications to the Scattered Data Interpolation Problem. In: Sergeyev, Y., Kvasov, D. (eds) Numerical Computations: Theory and Algorithms. NUMTA 2019. Lecture Notes in Computer Science(), vol 11973. Springer, Cham. https://doi.org/10.1007/978-3-030-39081-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-39081-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39080-8
Online ISBN: 978-3-030-39081-5
eBook Packages: Computer ScienceComputer Science (R0)