Name
Abstract | ||
|---|---|---|
In this paper we present a trivariate algorithm for fast computation of tetrahedral Shepard interpolants. Though the tetrahedral Shepard method achieves an approximation order better than classical Shepard formulas, it requires to detect suitable configurations of tetrahedra whose vertices are given by the set of data points. In doing that, we propose the use of a fast searching procedure based on the partitioning of domain and nodes in cubic blocks. This allows us to find the nearest neighbor points associated with each ball that need to be used in the 3D interpolation scheme. Numerical experiments show good performance of our interpolation algorithm. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10915-020-01159-3 | Journal of Scientific Computing |
Keywords | Field | DocType |
Scattered data interpolation, Tetrahedral Shepard operator, Fast algorithms, Approximation algorithms, 65D05, 65D15, 41A05 | k-nearest neighbors algorithm,Data point,Vertex (geometry),Interpolation,Algorithm,Trilinear interpolation,Tetrahedron,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
82 | 3 | 0885-7474 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Cavoretto | 1 | 111 | 14.76 |
| Alessandra De Rossi | 2 | 89 | 11.84 |
| F. Dell'accio | 3 | 38 | 7.36 |
| F. Di Tommaso | 4 | 27 | 5.25 |