Recovery of a Function from Information on Its Values at the Nodes of a Triangular Grid Based on Data Completion
We consider a method for binary completion of two-dimensional data. On the basis of information about a surface given by a triangular grid, we construct a continuous polygonal surface based on a denser grid (than the one given). We determine the error and norm of this method and study its properties.
KeywordsDense Grid Data Completion Triangular Grid Polygonal Surface Binary Completion
Unable to display preview. Download preview PDF.
- 1.I. Daubechies, Ten Lectures on Wavelets, SIAM, Philadelphia (1992).Google Scholar
- 2.A. A. Ligun and A. A. Shumeiko, “A linear method for the recovery of functions based on binary data completion,” Ukr. Mat. Zh., 53, No. 11, 1501–1512 (2001).Google Scholar
- 3.S. Dubuc, “Interpolation through an iterative scheme,” J. Math. Anal. Appl., 185–204 (1986).Google Scholar
- 4.S. de Marchi, The Dyadic Iterative Interpolation Method and Some Extensions, Technical Report No. 10.94, Univ. Padua (1994).Google Scholar