Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
441422 | Computer Aided Geometric Design | 2015 | 17 Pages |
Abstract
•We present a new algorithm for the adaptive refinement of T-meshes.•The algorithm preserves Analysis-Suitability and produces nested T-spline spaces.•Any two generated meshes have an analysis-suitable overlay.•We prove linear complexity of the refinement algorithm.
We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, that is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Philipp Morgenstern, Daniel Peterseim,