Volumetric Untrimming: Precise decomposition of trimmed trivariates into tensor products

3D objects, modeled using Computer Aided Geometric Design tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physical analysis, in isogeometric analysis (IGA) in specific, necessitates a volumetric parametrization of the interior of the object. IGA is performed directly by integrating over the spline spaces of the volumetric spline representation of the object. Typically, tensor-product B-spline trivariates are used to parameterize the volumetric domain. A general 3D object, that can be modeled in contemporary B-rep CAD tools, is typically represented using trimmed B-spline surfaces. In order to capture the generality of the contemporary B-rep modeling space, while supporting IGA needs, Massarwi and Elber (2016) proposed the use of trimmed trivariates volumetric elements. However, the use of trimmed geometry makes the integration process more difficult since integration over trimmed B-spline basis functions is a highly challenging task. In this work, we propose an algorithm that precisely decomposes a trimmed B-spline trivariate into a set of (singular only on the boundary) tensor-product B-spline trivariates, that can be utilized to simplify the integration process in IGA. The trimmed B-spline trivariate is first subdivided into a set of trimmed B\'ezier trivariates, at all its internal knots. Then, each trimmed B\'ezier trivariate, is decomposed into a set of mutually exclusive tensor-product B-spline trivariates, that precisely cover the entire trimmed domain. This process, denoted untrimming, can be performed in either the Euclidean space or the parametric space of the trivariate. We present examples on complex trimmed trivariates' based geometry, and we demonstrate the effectiveness of the method by applying IGA over the (untrimmed) results.Comment: 18 pages, 32 figures. Contribution accepted in International Conference on Geometric Modeling and Processing (GMP 2019

Smooth quasi-developable surfaces bounded by smooth curves

Computing a quasi-developable strip surface bounded by design curves finds wide industrial applications. Existing methods compute discrete surfaces composed of developable lines connecting sampling points on input curves which are not adequate for generating smooth quasi-developable surfaces. We propose the first method which is capable of exploring the full solution space of continuous input curves to compute a smooth quasi-developable ruled surface with as large developability as possible. The resulting surface is exactly bounded by the input smooth curves and is guaranteed to have no self-intersections. The main contribution is a variational approach to compute a continuous mapping of parameters of input curves by minimizing a function evaluating surface developability. Moreover, we also present an algorithm to represent a resulting surface as a B-spline surface when input curves are B-spline curves.Comment: 18 page

Isogeometric Analysis on V-reps: first results

Inspired by the introduction of Volumetric Modeling via volumetric representations (V-reps) by Massarwi and Elber in 2016, in this paper we present a novel approach for the construction of isogeometric numerical methods for elliptic PDEs on trimmed geometries, seen as a special class of more general V-reps. We develop tools for approximation and local re-parametrization of trimmed elements for three dimensional problems, and we provide a theoretical framework that fully justify our algorithmic choices. We validate our approach both on two and three dimensional problems, for diffusion and linear elasticity.Comment: 36 pages, 44 figures. Reviewed versio

Two triangulations methods based on edge refinement

In this paper two curvature adaptive methods of surface triangulation are presented. Both methods are based on edge refinement to obtain a triangulation compatible with the curvature requirements. The first method applies an incremental and constrained Delaunay triangulation and uses curvature bounds to determine if an edge of the triangulation is admissible. The second method uses this function also in the edge refinement process, i.e. in the computation of the location of a refining point, and in the re-triangulation needed after the insertion of this refining point. Results are presented, comparing both approachesPostprint (published version

3D NURBS-enhanced finite element method (NEFEM)

This paper presents the extension of the recently proposed NURBS-enhanced finite element method (NEFEM) to 3D domains. NEFEM is able to exactly represent the geometry of the computational domain by means of its CAD boundary representation with non-uniform rational B-splines (NURBS) surfaces. Specific strategies for interpolation and numerical integration are presented for those elements affected by the NURBS boundary representation. For elements not intersecting the boundary, a standard finite element rationale is used, preserving the efficiency of the classical FEM. In 3D NEFEM special attention must be paid to geometric issues that are easily treated in the 2D implementation. Several numerical examples show the performance and benefits of NEFEM compared with standard isoparametric or cartesian finite elements. NEFEM is a powerful strategy to efficiently treat curved boundaries and it avoids excessive mesh refinement to capture small geometric features

3D NURBS-enhanced finite element method (NEFEM)

This paper presents the extension of the recently proposed NURBS-enhanced finite element method (NEFEM) to 3D domains. NEFEM is able to exactly represent the geometry of the computational domain by means of its CAD boundary representation with non-uniform rational B-splines (NURBS) surfaces. Specific strategies for interpolation and numerical integration are presented for those elements affected by the NURBS boundary representation. For elements not intersecting the boundary, a standard finite element rationale is used, preserving the efficiency of the classical FEM. In 3D NEFEM special attention must be paid to geometric issues that are easily treated in the 2D implementation. Several numerical examples show the performance and benefits of NEFEM compared with standard isoparametric or cartesian finite elements. NEFEM is a powerful strategy to efficiently treat curved boundaries and it avoids excessive mesh refinement to capture small geometric features.Peer ReviewedPostprint (published version