Abstract
The need of scattered data interpolation methods in the multivariate framework and, in particular, in the trivariate case, motivates the generalization of the fast algorithm for triangular Shepard method. A block-based partitioning structure procedure was already applied to make the method very fast in the bivariate setting. Here the searching algorithm is extended, it allows to partition the domain and nodes in cubic blocks and to find the nearest neighbor points that need to be used in the tetrahedral Shepard interpolation.
Author supplied keywords
Cite
CITATION STYLE
Cavoretto, R., De Rossi, A., Dell’Accio, F., & Di Tommaso, F. (2020). A 3D Efficient Procedure for Shepard Interpolants on Tetrahedra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11973 LNCS, pp. 27–34). Springer. https://doi.org/10.1007/978-3-030-39081-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
