Advertisement

Ukrainian Mathematical Journal

, Volume 54, Issue 3, pp 409–420 | Cite as

Recovery of a Function from Information on Its Values at the Nodes of a Triangular Grid Based on Data Completion

  • A. A. Ligun
  • A. A. Shumeiko
Article

Abstract

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.

Keywords

Dense Grid Data Completion Triangular Grid Polygonal Surface Binary Completion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. 1.
    I. Daubechies, Ten Lectures on Wavelets, SIAM, Philadelphia (1992).Google Scholar
  2. 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. 3.
    S. Dubuc, “Interpolation through an iterative scheme,” J. Math. Anal. Appl., 185–204 (1986).Google Scholar
  4. 4.
    S. de Marchi, The Dyadic Iterative Interpolation Method and Some Extensions, Technical Report No. 10.94, Univ. Padua (1994).Google Scholar

Copyright information

© Plenum Publishing Corporation 2002

Authors and Affiliations

  • A. A. Ligun
    • 1
  • A. A. Shumeiko
  1. 1.Dneprodzerzhinsk Technical UniversityDneprodzerzhinsk

Personalised recommendations