## Abstract

The Delaunay triangulation, in both classic and more generalized sense, is studied for minimizing the linear interpolation error (measure in L^{P}-norm) for a given function. The classic Delaunay triangulation can then be characterized as an optimal triangulation that minimizes the interpolation error for the isotropic function ||x||^{2} among all the triangulations with a given set of vertices. For a more general function, a function-dependent Delaunay triangulation is then defined to be an optimal triangulation that minimizes the interpolation error for this function and its construction can be obtained by a simple lifting and projection procedure. The optimal Delaunay triangulation is the one that minimizes the interpolation error among all triangulations with the same number of vertices, i.e. the distribution of vertices are optimized in order to minimize the interpolation error. Such a function-dependent optimal Delaunay triangulation is proved to exist for any given convex continuous function. On an optimal Delaunay triangulation associated with f, it is proved that ∇f at the interior vertices can be exactly recovered by the function values on its neighboring vertices. Since the optimal Delaunay triangulation is difficult to obtain in practice, the concept of nearly optimal triangulation is introduced and two sufficient conditions are presented for a triangulation to be nearly optimal.

Original language | English (US) |
---|---|

Pages (from-to) | 299-308 |

Number of pages | 10 |

Journal | Journal of Computational Mathematics |

Volume | 22 |

Issue number | 2 |

State | Published - Mar 1 2004 |

## All Science Journal Classification (ASJC) codes

- Computational Mathematics