A Versatile Strategy for the Implementation of Adaptive Splines

@inproceedings{Bressan2016AVS,
  title={A Versatile Strategy for the Implementation of Adaptive Splines},
  author={Andrea Bressan and Dominik Mokris},
  booktitle={MMCS},
  year={2016}
}
This paper presents an implementation framework for spline spaces over T-meshes (and their d-dimensional analogs). The aim is to share code between the implementations of several spline spaces. This is achieved by reducing evaluation to a generalized Bezier extraction. 
3 Citations

Local Approximation from Spline Spaces on Box Meshes

TLDR
Local and global error bounds with respect to Sobolev or reduced seminorms are provided, and exponential convergence is proved for the approximation of analytic functions in the absence of non-convex extended supports.

References

SHOWING 1-10 OF 46 REFERENCES

T-spline simplification and local refinement

TLDR
An algorithm for eliminating superfluous control points, producing a T-spline, which can remove substantially more control points than competing methods such as B- Spline wavelet decomposition is presented.

On linear independence of T-spline blending functions

Analysis-suitable adaptive T-mesh refinement with linear complexity

Globally Structured Three-Dimensional Analysis-Suitable T-Splines: Definition, Linear Independence and m-graded local refinement

TLDR
An abstract definition of analysis-suitability is given and it is proved that it is equivalent to dual-compatibility, which guarantees linear independence of the T-spline blending functions.

New refinable spaces and local approximation estimates for hierarchical splines

TLDR
This construction suggests the analysis of a subspace of the classical hierarchical spline space which still satisfies the essential properties of the full space and can be constructed using parent-children relations only, making it well adapted to local refinement algorithms.

ANALYSIS-SUITABLE T-SPLINES OF ARBITRARY DEGREE: DEFINITION, LINEAR INDEPENDENCE AND APPROXIMATION PROPERTIES

TLDR
This paper defines analysis-suitable T-splines of arbitrary degree and proves fundamental properties: Linear independence of the blending functions and optimal approximation properties of the associated T- Spline space.

Algorithms and Data Structures for Truncated Hierarchical B-splines

TLDR
This work presents an effective implementation of the fundamental algorithms needed for the manipulation of THB–spline representations based on standard data structures by combining a quadtree data structure — which is used to represent the nested sequence of subdomains — with a suitable data structure for sparse matrices.

Polynomial splines over hierarchical T-meshes