Locally refined spline surfaces (LRB) is a representation well suited for scattered data approximation. When a data set has local details in some areas and is largely smooth in other, LR B-splines allow the spatial distribution of degrees of freedom to follow the variations of the data set. An LRB surface approximating a data set is refined in areas where the accuracy does not meet a required tolerance. In this paper we address, in a systematic study, different LRB refinement strategies and polynomial degrees for surface approximation. We study their influence on data volume and accuracy when applied to geospatial data sets with different structural behaviour. The performance of the refinement strategies is to some degree coherent and the article concludes with some recommendations. An overall evaluation indicates that bi-quadratic LRB are preferable for the uses cases tested, and that the strategies we denote as 'full span' have the overall best performance.
We consider two-stage scattered data fitting with truncated hierarchical B-splines (THB-splines) for the adaptive reconstruction of industrial models. The first stage of the scheme is devoted to the computation of local least squares variational spline approximations, exploiting a simple fairness functional to handle data distributions with a locally varying density of points. Hierarchical spline quasi-interpolation based on THB-splines is considered in the second stage of the method to construct the adaptive spline surface approximating the whole scattered data set and a suitable strategy to …
We present a novel method named truncated hierarchical unstructured splines (THU-splines) that supports both local $h$-refinement and unstructured quadrilateral meshes. In a THU-spline construction, an unstructured quadrilateral mesh is taken as the input control mesh, where the degenerated-patch method [18] is adopted in irregular regions to define $C^1$-continuous bicubic splines, whereas regular regions only involve $C^2$ B-splines. Irregular regions are then smoothly joined with regular regions through the truncation mechanism [29], leading to a globally smooth spline construction. Subsequ…
In this contribution, we introduce a multilevel approximation method with T-splines for fitting scattered point clouds iteratively, with an application to land remote sensing. This new procedure provides a local surface approximation by an explicit computation of the control points and is called a multilevel T-splines approximation (MTA). It is computationally efficient compared with the traditional global least-squares (LS) approach, which may fail when there is an unfavourable point density from a given refinement level. We validate our approach within a simulated framework and apply it to t…
We present a new refinement strategy for locally refined B-splines which ensures the local linear independence of the basis functions. The strategy also guarantees the spanning of the full spline space on the underlying locally refined mesh. The resulting mesh has nice grading properties which grant the preservation of shape regularity and local quasi uniformity of the elements in the refining process.
In this paper we describe an adaptive refinement strategy for LR B-splines. The presented strategy ensures, at each iteration, local linear independence of the obtained set of LR B-splines. This property is then exploited in two applications: the construction of efficient quasi-interpolation schemes and the numerical solution of elliptic problems using the isogeometric Galerkin method.
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 sch…
Bézier projection: a unified approach for local projection and quadrature-free refinement and coarsening of NURBS and T-splines with particular application to isogeometric design and analysis
Brigham Young University（杨百翰大学）；University of Colorado, Boulder（科罗拉多大学博尔德分校）
This paper presents a PDE-based planar parameterization framework with support for Truncated Hierarchical B-Splines (THB-splines). For this, we adopt the a posteriori refinement strategy of Dual Weighted Residual and present several adaptive numerical schemes for the purpose of approximating an inversely harmonic geometry parameterization. Hereby, the combination of goal-oriented a posteriori strategies and THB-enabled local refinement avoids over-refinement, in particular in geometries with complex boundaries. To control the parametric properties of the outcome, we introduce the concept of do…
Department of Mathematics and Informatics, Vilnius University（维尔纽斯大学数学与信息学系）；Institute of Mathematics and Informatics（维尔纽斯大学数学与信息学研究所）；Institute of Computational Math. and Sci. and Eng. Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）
Suitably graded THB-spline refinement and coarsening: Towards an adaptive isogeometric analysis of additive manufacturing processes
University of Pavia（帕维亚大学）；Technische Universität München（慕尼黑工业大学）；Università degli Studi di Firenze（佛罗伦萨大学）；Ecole Polytechnique Fédérale de Lausanne（洛桑联邦理工学院）；Istituto di Matematica Applicata e Tecnologie Informatiche “E. Magenes” del CNR（意大利国家研究委员会应用数学与信息技术研究所）
We compare a recently proposed multivariate spline based on mixed partial derivatives with two other standard splines for the scattered data smoothing problem. The splines are defined as the minimiser of a penalised least squares functional. The penalties are based on partial differentiation operators, and are integrated using the finite element method. We compare three methods to two problems: to remove the mixture of Gaussian and impulsive noise from an image, and to recover a continuous function from a set of noisy observations.
Local h-, p-, and k-Refinement Strategies for the Isogeometric Shifted Boundary Method Using THB-Splines
Technische Universität München（慕尼黑工业大学）；OTH Regensburg（雷根斯堡应用科学大学）；Universidad Politécnica de Cataluña (UPC)（加泰罗尼亚理工大学）；Centre Internacional de Mètodes Numèrics en Enginyeria (CIMNE)（国际工程数值方法中心）
Bases of T-meshes and the refinement of hierarchical B-splines
The University of Auckland（奥克兰大学）；Seoul National University（首尔大学）；Dongguk University（东国大学）；University of Turin（都灵大学）；Asian Institute of Technology（亚洲理工学院）
Adaptive isogeometric phase-field modeling of the Cahn-Hilliard equation: Suitably graded hierarchical refinement and coarsening on multi-patch geometries
New refinable spaces and local approximation estimates for hierarchical splines
Istituto di Matematica Applicata e Tecnologie Informatiche ‘E. Magenes’ (CNR)（应用数学与信息技术研究所‘E.马格内斯’（意大利国家研究委员会））；Instituto de Matemática Aplicada del Litoral (CONICET-UNL)（拉普拉塔河沿岸应用数学研究所（阿根廷国家科学研究委员会-国立圣路易斯大学））；Facultad de Ingeniería Química (UNL)（化学工程学院（国立圣路易斯大学））
To exploit the advantageous properties of isogeometric analysis (IGA) in a scan-based setting, it is important to extract a smooth geometric domain from the scan data (e.g., voxel data). IGA-suitable domains can be constructed by convoluting the grayscale data using B-splines. A negative side-effect of this convolution technique is, however, that it can induce topological changes in the process of smoothing when features with a size similar to that of the voxels are encountered. This manuscript presents an enhanced B-spline-based segmentation procedure using a refinement strategy based on trun…
In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid spacing, an appropriate derivative of the function to be approximated, and an explicit constant which is, in many cases, sharp. Some of these error estimates also hold in proper spline subspaces, which additionally enjoy inverse inequalities. Furthermore, we address spline approximation of eigenfunctions of a large class of differential operators, with a particula…
Subdivision surfaces provide an elegant isogeometric analysis framework for geometric design and analysis of partial differential equations defined on surfaces. They are already a standard in high-end computer animation and graphics and are becoming available in a number of geometric modelling systems for engineering design. The subdivision refinement rules are usually adapted from knot insertion rules for splines. The quadrilateral Catmull-Clark scheme considered in this work is equivalent to cubic B-splines away from extraordinary, or irregular, vertices with other than four adjacent element…
The popularity of local meshless methods in the field of numerical simulations has increased greatly in recent years. This is mainly due to the fact that they can operate on scattered nodes and that they allow a direct control over the approximation order and basis functions. In this paper we analyse two popular variants of local strong form meshless methods, namely the radial basis function-generated finite differences (RBF-FD) using polyharmonic splines (PHS) augmented with monomials, and the weighted least squares (WLS) approach using only monomials. Our analysis focuses on the accuracy and…
The data driven extrapolation requires the definition of a functional model depending on the available data and has the application scope of providing reliable predictions on the unknown dynamics. Since data might be scattered, we drive our attention towards kernel models that have the advantage of being meshfree. Precisely, the proposed numerical method makes use of the so-called Variably Scaled Kernels (VSKs), which are introduced to implement a feature augmentation-like strategy based on discrete data. Due to the possible uncertainty on the data and since we are interested in modelling the …
Stochastic Convergence of A Nonconforming Finite Element Method for the Thin Plate Spline Smoother for Observational Data
LSEC, Institute of Computational Mathematics, Academy of Mathematics and System Sciences and School of Mathematical Science, University of Chinese Academy of Sciences, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学研究所、中国科学院大学数学科学学院）；Institute of Systems Science, Academy of Mathematics and System Sciences, Chinese Academy of Sciences（中国科学院数学与系统科学研究院系统科学研究所）；School of Mathematical Science, University of Chinese Academy of Sciences, Chinese Academy of Sciences（中国科学院大学数学科学学院）
We propose an adaptive mesh refinement strategy for immersed isogeometric analysis, with application to steady heat conduction and viscous flow problems. The proposed strategy is based on residual-based error estimation, which has been tailored to the immersed setting by the incorporation of appropriately scaled stabilization and boundary terms. Element-wise error indicators are elaborated for the Laplace and Stokes problems, and a THB-spline-based local mesh refinement strategy is proposed. The error estimation .and adaptivity procedure is applied to a series of benchmark problems, demonstrat…
This paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate conformal meshes, this work uses an eXtended Finite Element Method (XFEM) to discretize the governing equations on non-conforming, embedding meshes. A flexible approach to create truncated hierarchical B-splines discretizations is presented. This approach enables the refinement of each state variable field individually to meet field-specific accuracy requirements…
Complexity of hierarchical refinement for a class of admissible mesh configurations
Rheinische Friedrich-Wilhelms-Universität Bonn（波恩大学）；Istituto di Matematica Applicata e Tecnologie Informatiche ‘E.˜Magenes’ del CNR（CNR应用数学与信息技术研究所‘E.马格内斯’）；Istituto Nazionale di Alta Matematica, Unità di Ricerca di Firenze c/o DiMaI ‘U.˜Dini’, Università di Firenze（佛罗伦萨大学迪马伊‘乌·迪尼’单位，意大利高等数学研究所）
