Bivariate segment approximation and splines (Q675684)

The problem to determine partitions of a given rectangle which are optimal for segment approximation (e.g., by bivariate piecewise polynomials) is investigated. We give criteria for optimal partitions and develop algorithms for computing optimal partitions of certain types. It is shown that there is a surprising relationship between various types of optimal partitions. In this way, we obtain good partitions for interpolation by tensor product spline spaces. Our numerical examples show that the methods work efficiently.