RECORD
Adaptive Refinement for Unstructured T-Splines with Linear Complexity
Numerical Analysis · Submitted 1 Sep 2021
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Further, we show that the refinement procedure has linear complexity in the sense of guaranteed upper bounds on a) the distance between marked and additionally refined elements, and on b) the ratio of the numbers of generated and marked mesh elements.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly to unstructured meshes, where no two unique global mesh directions can be assigned. To resolve this issue, we introduce the concept of direction indices, i.e., integers associated to each edge, which are inspired by theory on higher-dimensional structured T-splines. Together with refinement levels of edges, these indices essentially drive the refinement scheme. We combine these ideas with an edge subdivision routine that allows for I-nodes, yielding a very flexible refinement scheme that nicely distributes the T-nodes, preserving global linear independence, analysis-suitability (local linear independence) except in the vicinity of extraordinary nodes, sparsity of the system matrix, and shape regularity of the mesh elements. Further, we show that the refinement procedure has linear complexity in the sense of guaranteed upper bounds on a) the distance between marked and additionally refined elements, and on b) the ratio of the numbers of generated and marked mesh elements.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. | contribution 1.00 | 0.94 | 0.18 | asserted 1.00 |
| s1 | While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly to unstructured meshes, where no two unique global mesh directions can be assigned. | background 0.76 | 0.10 | 0.03 | asserted 0.98 |
| s2 | To resolve this issue, we introduce the concept of direction indices, i.e., integers associated to each edge, which are inspired by theory on higher-dimensional structured T-splines. | contribution 0.66 | 0.88 | 0.05 | asserted 1.00 |
| s3 | Together with refinement levels of edges, these indices essentially drive the refinement scheme. | method 0.94 | 0.70 | 0.08 | asserted 1.00 |
| s4 | We combine these ideas with an edge subdivision routine that allows for I-nodes, yielding a very flexible refinement scheme that nicely distributes the T-nodes, preserving global linear independence, analysis-suitability (local linear independence) except in the vicinity of extraordinary nodes, sparsity of the system matrix, and shape regularity of the mesh elements. | method 0.82 | 0.88 | 0.20 | asserted 0.99 |
| s5 | Further, we show that the refinement procedure has linear complexity in the sense of guaranteed upper bounds on a) the distance between marked and additionally refined elements, and on b) the ratio of the numbers of generated and marked mesh elements. | result 0.93 | 0.95 | 0.47 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly to unstructured meshes, where no two unique global mesh directions can be assigned. To resolve this issue, we introduce the concept of direction indices, i.e., integers associated to each edge, which are inspired by theory on higher-dimensional structured T-splines. Together with refinement levels of edges, these indices essentially drive the refinement scheme. We combine these ideas with an edge subdivision routine that allows for I-nodes, yielding a very flexible refinement scheme that nicely distributes the T-nodes, preserving global linear independence, analysis-suitability (local linear independence) except in the vicinity of extraordinary nodes, sparsity of the system matrix, and shape regularity of the mesh elements. Further, we show that the refinement procedure has linear complexity in the sense of guaranteed upper bounds on a) the distance between marked and additionally refined elements, and on b) the ratio of the numbers of generated and marked mesh elements.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.