Constructing Trivariate B-splines with Positive Jacobian by Pillow Operation and Geometric Iterative Fitting (original) (raw)
Related papers
Computer Methods in Applied Mechanics and Engineering, 2016
Local refinement with hierarchical B-spline structures is an active topic of research in the context of geometric modeling and isogeometric analysis. By exploiting a multilevel control structure, we show that truncated hierarchical B-spline (THB-spline) representations support interactive modeling tools, while simultaneously providing effective approximation schemes for the manipulation of complex data sets and the solution of partial differential equations via isogeometric analysis. A selection of illustrative 2D and 3D numerical examples demonstrates the potential of the hierarchical framework.
2011
Abstract Isogeometric analysis has become a powerful alternative to standard finite elements due to its flexibility in handling complex geometries. One of the major drawbacks of NURBS-based isogeometric finite elements is the inefficiency of local refinement. In this study, we present an alternative to NURBS-based isogeometric analysis that allows for local refinement. The idea is based on polynomial splines and exploits the flexibility of T-meshes for local refinement.
IsoGeometric analysis using T-splines on two-patch geometries
Computer Methods in Applied Mechanics and Engineering, 2011
We develop optimal approximation estimates for T-splines in the case of geometries obtained by gluing two standard tensor product patches. We derive results both for the T-spline space in the parametric domain and the mapped T-NURBS in the physical one. A set of numerical tests in complete accordance with the theoretical developments is also presented. j o u r n a l h o m e p a g e : w w w . e l s e v i e r . c o m / l o c a t e / c m a the first theoretical result on error analysis of the Isogeometric method based on T-splines.
B-spline interpolation to a closed mesh
Computer-Aided Design, 2011
This paper focuses on interpolating vertices and normal vectors of a closed quad-dominant mesh 1 G 2continuously using regular Coons B-spline surfaces, which are popular in industrial CAD/CAM systems. We first decompose all non-quadrangular facets into quadrilaterals. The tangential and second-order derivative vectors are then estimated on each vertex of the quads. A least-square adjustment algorithm based on the homogeneous form of G 2 continuity condition is applied to achieve curvature continuity. Afterwards, the boundary curves, the first-and the second-order cross-boundary derivative curves are constructed fulfilling G 2 continuity and compatibility conditions. Coons B-spline patches are finally generated using these curves as boundary conditions. In this paper, the upper bound of the rank of G 2 continuity condition matrices is also strictly proved to be 2n − 3, and the method of tangentvector estimation is improved to avoid petal-shaped patches in interpolating solids of revolution. Several examples demonstrate its feasibility.
Automatic Unstructured Mesh Generation Around Two-Dimensional Domains Described by B-Spline Curves
Volume 1: 21st Computers and Information in Engineering Conference, 2001
A computer code for the generation of unstructured two-dimensional triangular meshes around arbitrary complex geometries has been developed. The code is based on Delaunay triangulation with an automatic point insertion scheme and a smoothing technique. The geometrical definition of the domain to be meshed is prescribed by means of B-spline curves obtained from two approaches of interest in Computer-Aided Geometric Design named inverse design and interpolation problems. The presented scheme is based on an interpolation procedure along a B-spline curve proposed by the author in a recent paper. This technique prevents that the resulting grid may overlap convex portions of the boundaries. The main goal is to study the possibility of extend the methodology of unstructured grid generation beginning with boundaries described by polylines to other in which they are prescribed by piecewise polynomials curves capable to drive more realistic problems. Several figures and examples from Computat...
Isogeometric finite element data structures based on Bézier extraction of T-splines
International Journal for Numerical Methods in Engineering, 2011
We develop finite element data structures for T-splines based on Bézier extraction generalizing our previous work for NURBS. As in traditional finite element analysis, the extracted Bézier elements are defined in terms of a fixed set of polynomial basis functions, the so-called Bernstein basis. The Bézier elements may be processed in the same way as in a standard finite element computer program, utilizing exactly the same data processing arrays. In fact, only the shape function subroutine needs to be modified while all other aspects of a finite element program remain the same. A byproduct of the extraction process is the element extraction operator. This operator localizes the topological and global smoothness information to the element level, and represents a canonical treatment of T-junctions, referred to as 'hanging nodes' in finite element analysis and a fundamental feature of T-splines. A detailed example is presented to illustrate the ideas. Figure 2. A schematic diagram illustrating the central role played by Bézier extraction in unifying CAGD and FEA.
Isogeometric boundary element analysis using unstructured T-splines
We couple collocated isogeometric boundary element methods and unstructured analysis-suitable T-spline surfaces for linear elastostatic problems. We extend the definition of analysis-suitable T-splines to encompass unstructured control grids (unstructured meshes) and develop basis functions which are smooth (rational) polynomials defined in terms of the Be ́zier extraction framework and which pass standard patch tests. We then develop a collocation procedure which correctly accounts for sharp edges and corners, extraordinary points, and T-junctions. This approach is applied to several demanding three-dimensional problems, including a T-spline model of a propeller. Remarkable accuracy is obtained in all cases.
B-spline Curve Smoothing for Isobathymetric Line Generalization
Annals of GIS, 2005
This paper introduces a new method for curve smoothing which is specific for isobathymetric line generalization. Isobaths are modeled with B-spline curves that can maintain the smooth feature of the curves. Smoothing is performed by keeping the curve points always on the deepest side of the original curve so that the result is consistent with the safety constraint. It is done by using a snake model in which the constraints and the smoothness are expressed via external and internal energies defined from the curve derivatives. The advantage of the model is that the deformation is done by minimizing the system energy and, by tuning the parameters during the process, convergence towards a valid solution is ensured. Results from real case studies are presented.
2019
This thesis addresses an adaptive higher-order method based on a Geometry Independent Field approximatTion(GIFT) of polynomial/rationals plines over hierarchical T-meshes(PHT/RHT-splines). In isogeometric analysis, basis functions used for constructing geometric models in computer-aided design(CAD) are also employed to discretize the partial differential equations(PDEs) for numerical analysis. Non-uniform rational B-Splines(NURBS) are the most commonly used basis functions in CAD. However, they may not be ideal for numerical analysis where local refinement is required. The alternative method GIFT deploys different splines for geometry and numerical analysis. NURBS are utilized for the geometry representation, while for the field solution, PHT/RHT-splines are used. PHT-splines not only inherit the useful properties of B-splines and NURBS, but also possess the capabilities of local refinement and hierarchical structure. The smooth basis function properties of PHT-splines make them sui...