Polynomial splines of non-uniform degree on triangulations

Combinatorial bounds on the dimension

Journal Article (2019)
Author(s)

Deepesh Toshniwal (TU Delft - Electrical Engineering, Mathematics and Computer Science, The University of Texas at Austin)

Thomas J.R. Hughes (The University of Texas at Austin)

Research Group
Numerical Analysis
DOI related publication
https://doi.org/10.1016/j.cagd.2019.07.002 Final published version
More Info
expand_more
Publication Year
2019
Language
English
Research Group
Numerical Analysis
Journal title
Computer Aided Geometric Design
Volume number
75
Article number
101763
Pages (from-to)
1-22
Downloads counter
193

Abstract

For T a planar triangulation, let Rm r(T) denote the space of bivariate splines on T such that f∈Rm r(T) is Cr(τ) smooth across an interior edge τ and, for triangle σ in T, f|σ is a polynomial of total degree at most m(σ)∈Z≥0. The map m:σ↦Z≥0 is called a non-uniform degree distribution on the triangles in T, and we consider the problem of computing (or estimating) the dimension of Rm r(T) in this paper. Using homological techniques, developed in the context of splines by Billera (1988), we provide combinatorial lower and upper bounds on the dimension of Rm r(T). When all polynomial degrees are sufficiently large, m(σ)≫0, we prove that the number of splines in Rm r(T) can be determined exactly. In the special case of a constant map m, the lower and upper bounds are equal to those provided by Mourrain and Villamizar (2013).