Optimal Lagrange interpolation by quartic C1 splines on triangulations

  • Authors:
  • C. K. Chui;G. Hecklin;G. Nürnberger;F. Zeilfelder

  • Affiliations:
  • Department of Mathematics and Computer Science, University of Missouri, St. Louis, MO, USA;Institute of Mathematics, University of Mannheim, 68 131 Mannheim, Germany;Institute of Mathematics, University of Mannheim, 68 131 Mannheim, Germany;Institute of Mathematics, University of Mannheim, 68 131 Mannheim, Germany

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 7.29

Visualization

Abstract

We develop a local Lagrange interpolation scheme for quartic C^1 splines on triangulations. Given an arbitrary triangulation @D, we decompose @D into pairs of neighboring triangles and add ''diagonals'' to some of these pairs. Only in exceptional cases, a few triangles are split. Based on this simple refinement of @D, we describe an algorithm for constructing Lagrange interpolation points such that the interpolation method is local, stable and has optimal approximation order. The complexity for computing the interpolating splines is linear in the number of triangles. For the local Lagrange interpolation methods known in the literature, about half of the triangles have to be split.