Abstract

In this paper, we present an efficient algorithm for the computation of triangular Shepard interpolation method. More precisely, it is well known that the triangular Shepard method reaches an approximation order better than the Shepard one (DellAccio et al., 2016), but it needs to identify useful general triangulation of the node set. Here we propose a searching technique used to detect and select the nearest neighbor points in the interpolation scheme (Cavoretto et al., 2016, 2017). It consists in determining the closest points belonging to the different neighborhoods and subsequently applies to the triangulation-based approach. Numerical experiments and some geological applications show efficiency and accuracy of the interpolation procedure.

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 call

Disclaimer: 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.