A lower bound for the dimension of tetrahedral splines in large degree
Michael DiPasquale, Nelly Villamizar

TL;DR
This paper establishes a new lower bound for the dimension of large-degree, differentiably continuous tetrahedral splines, which can be exact under generic vertex configurations, using algebraic methods.
Contribution
It introduces a novel algebraic formula for the lower bound of spline space dimensions that is accurate in large degree for generic vertex arrangements.
Findings
The formula provides an exact dimension in large degree for generic vertex positions.
Existing bounds diverge significantly from actual dimensions in large degree.
The approach uses commutative and homological algebra techniques.
Abstract
We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order in large enough degree. While this formula may fail to be a lower bound on the dimension of the spline space in low degree, we illustrate in several examples considered by Alfeld and Schumaker that our formula may give the exact dimension of the spline space in large enough degree if vertex positions are generic. In contrast, for splines continuously differentiable of order , every lower bound in the literature diverges (often significantly) in large degree from the dimension of the spline space in these examples. We derive the bound using commutative and homological algebra.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Computational Geometry and Mesh Generation · Digital Image Processing Techniques
