Circular Arc Approximation by Quartic H-Bézier Curve

The quartic H-Bézier curve is used for the approximation of circular arcs. It has five control points and one positive real free parameter. The four control points are carried out b

Circular Arc Approximation by Quartic H-Bézier Curve

The quartic H-Bézier curve is used for the approximation of circular arcs. It has five control points and one positive real free parameter. The four control points are carried out b

Constrained Interpolation And Shape Preserving Approximation By Space Curves [QA297.6. K82 2006 f rb].

Dua jenis masalah rekabentuk lengkung telah ipertimbangkan. Terlebih dahulu kami mempertimbangkan interpolasi satu set titik data ruang yang bertertib dengan satu lengkung licin tertakluk kepada satu set satah kekangan yang berbentuk terhingga atau tak terhingga di mana garis cebis demi cebis yang menyambung titik data secara berturutan tidak bersilang dengan satah kekangan. Two types of curve designing problem have been considered. We first consider the interpolation of a given set of ordered spatial data points by a smooth curve in the presence of a set of finite or infinite constraint planes, where the polyline joining consecutive data points does not intersect with the constraint planes

Isogeometric Design, Analysis and Optimisation of Lattice-Skin Structures

The advancements in additive manufacturing techniques enable novel designs using lattice structures in mechanical parts, lightweight materials, biomaterials and so forth. Lattice-skin structures are a class of structures that couple thin-shells with lattices, which potentially combine the advantages of the thin-shell and the lattice structure. A new and systematic isogeometric analysis approach that integrates the geometric design, structural analysis and optimisation of lattice-skin structures is proposed in the dissertation. In the geometric design of lattice-skin structures, a novel shape interrogation scheme for splines, specifically subdivision surfaces, is proposed, which is able to compute the line/surface intersection efficiently and robustly without resorting to successive refinements or iterations as in Newton-Raphson method. The line/surface intersection algorithm involves two steps: intersection detection and intersection computation. In the intersection detection process, a bounding volume tree of k-dops (discrete oriented polytopes) for the subdivision surface is first created in order to accelerate the intersection detection between the line and the surface. The spline patches which are detected to be possibly intersected by the line are converted to Bézier representations. For the intersection computation, a matrix-based algorithm is applied, which converts the nonlinear intersection computation into solving a sequence of linear algebra problems using the singular value decomposition (SVD). Finally, the lattice-skin geometry is generated by projecting selected lattice nodes to the nearest intersection points intersected by the lattice edges. The Stanford bunny example demonstrates the efficiency and accuracy of the developed algorithm. The structural analysis of lattice-skin structures follows the isogeometric approach, in which the thin-shell is discretised with spline basis functions and the lattice structure is modelled with pin-jointed truss elements. In order to consider the lattice-skin coupling, a Lagrange multiplier approach is implemented to enforce the displacement compatibility between the coupled lattice nodes and the thin-shell. More importantly, the parametric coordinates of the coupled lattice nodes on the thin-shell surface are obtained directly from the lattice-skin geometry generation, which integrates the design and analysis process of lattice-skin structures. A sandwich plate example is analysed to verify the implementation and the accuracy of the lattice-skin coupling computation. In addition, a SIMP-like lattice topology optimisation method is proposed. The topology optimisation results of lattice structures are analysed and compared with several examples adapted from the benchmark examples commonly used in continuum topology optimisation. The SIMP-like lattice topology optimisation proposed is further applied to optimise the lattice in lattice-skin structures. The lattice-skin topology optimisation is fully integrated with the lattice-skin geometry design since the sensitivity analysis in the proposed method is based on lattice unit cells which are inherited from the geometry design stage. Finally, shape optimisation of lattice-skin structures using the free-form deformation (FFD) technique is studied. The corresponding shape sensitivity of lattice-skin structures is derived. The geometry update of the lattice-skin structure is determined by the deformation of the FFD control volume, and in this process the coupling between lattice nodes and the thin-shell is guaranteed by keeping the parametric coordinates of coupled lattice nodes which are obtained in the lattice-skin geometry design stage. A pentagon roof example is used to explore the combination of lattice topology optimisation and shape optimisation of lattice-skin structures

Arbitrary topology meshes in geometric design and vector graphics

Meshes are a powerful means to represent objects and shapes both in 2D and 3D, but the techniques based on meshes can only be used in certain regular settings and restrict their usage. Meshes with an arbitrary topology have many interesting applications in geometric design and (vector) graphics, and can give designers more freedom in designing complex objects. In the first part of the thesis we look at how these meshes can be used in computer aided design to represent objects that consist of multiple regular meshes that are constructed together. Then we extend the B-spline surface technique from the regular setting to work on extraordinary regions in meshes so that multisided B-spline patches are created. In addition, we show how to render multisided objects efficiently, through using the GPU and tessellation. In the second part of the thesis we look at how the gradient mesh vector graphics primitives can be combined with procedural noise functions to create expressive but sparsely defined vector graphic images. We also look at how the gradient mesh can be extended to arbitrary topology variants. Here, we compare existing work with two new formulations of a polygonal gradient mesh. Finally we show how we can turn any image into a vector graphics image in an efficient manner. This vectorisation process automatically extracts important image features and constructs a mesh around it. This automatic pipeline is very efficient and even facilitates interactive image vectorisation

Robust multigrid methods for Isogeometric discretizations applied to poroelasticity problems

El análisis isogeométrico (IGA) elimina la barrera existente entre elementos finitos (FEA) y el diseño geométrico asistido por ordenador (CAD). Debido a esto, IGA es un método novedoso que está recibiendo una creciente atención en la literatura y recientemente se ha convertido en tendencia. Muchos esfuerzos están siendo puestos en el diseño de solvers eficientes y robustos para este tipo de discretizaciones. Dada la optimalidad de los métodos multimalla para elementos finitos, la aplicación de estosmétodos a discretizaciones isogeométricas no ha pasado desapercibida. Nosotros pensamos firmemente que los métodos multimalla son unos candidatos muy prometedores a ser solvers eficientes y robustos para IGA y por lo tanto en esta tesis apostamos por su aplicación. Para contar con un análisis teórico para el diseño de nuestros métodos multimalla, el análisis local de Fourier es propuesto como principal análisis cuantitativo. En esta tesis, a parte de considerar varios problemas escalares, prestamos especial atención al problema de poroelasticidad, concretamente al modelo cuasiestático de Biot para el proceso de consolidación del suelo. Actualmente, el diseño de métodos multimalla robustos para problemas poroelásticos respecto a parámetros físicos o el tamaño de la malla es un gran reto. Por ello, la principal contribución de esta tesis es la propuesta de métodos multimalla robustos para discretizaciones isogeométricas aplicadas al problema de poroelasticidad.La primera parte de esta tesis se centra en la construcción paramétrica de curvas y superficies dado que estas técnicas son la base de IGA. Así, la definición de los polinomios de Bernstein y curvas de Bézier se presenta como punto de partida. Después, introducimos los llamados B-splines y B-splines racionales no uniformes (NURBS) puesto que éstas serán las funciones base consideradas en nuestro estudio.La segunda parte trata sobre el análisis isogeométrico propiamente dicho. En esta parte, el método isoparamétrico es explicado al lector y se presenta el análisis isogeométrico de algunos problemas. Además, introducimos la formulación fuerte y débil de los problemas anteriores mediante el método de Galerkin y los espacios de aproximación isogeométricos. El siguiente punto de esta tesis se centra en los métodos multimalla. Se tratan las bases de los métodos multimalla y, además de introducir algunos métodos iterativos clásicos como suavizadores, también se introducen suavizadores por bloques como los métodos de Schwarz multiplicativos y aditivos. Llegados a esta parte, nos centramos en el LFA para el diseño de métodos multimalla robustos y eficientes. Además, se explican en detalle el análisis estándar y el análisis basado en ventanas junto al análisis de suavizadores por bloques y el análisis para sistemas de ecuaciones en derivadas parciales.Tras introducir las discretizaciones isogeométricas, los métodos multimalla y el LFA como análisis teórico, nuestro propósito es diseñar métodos multimalla eficientes y robustos respecto al grado polinomial de los splines para discretizaciones isogeométricas de algunos problemas escalares. Así, mostramos que el uso de métodos multimalla basados en suavizadores de tipo Schwarz multiplicativo o aditivo produce buenos resultados y factores de convergencia asintóticos robustos. La última parte de esta tesis está dedicada al análisis isogeométrico del problema de poroelasticidad. Para esta tarea, se introducen el modelo de Biot y su discretización isogeométrica. Además, presentamos una novedosa estabilización de masa para la formulación de dos campos de las ecuaciones de Biot que elimina todas las oscilaciones no físicas en la aproximación numérica de la presión. Después, nos centramos en dos tipos de solvers para estas ecuaciones poroelásticas: Solvers desacoplados y solvers monolíticos. En el primer grupo, le dedicamos una especial atención al método fixed-stress y a un método iterativo propuesto por nosotros que puede ser aplicado de forma automática a partir de la estabilización de masa ya mencionada.Por otro lado, realizamos un análisis de von Neumann para este método iterativo aplicado al problema de Terzaghi y demostramos su estabilidad y convergencia para los pares de elementos Q1 Q1, Q2 Q1 y Q3 Q2 (con suavidad global C1). Respecto al grupo de solvers monolíticos, nosotros proponemos métodos multimalla basados en suavizadores acoplados y desacoplados. En esta parte, métodosIsogeometric analysis (IGA) eliminates the gap between finite element analysis (FEA) and computer aided design (CAD). Due to this, IGA is an innovative approach that is receiving an increasing attention in the literature and it has recently become a trending topic. Many research efforts are being devoted to the design of efficient and robust solvers for this type of discretization. Given the optimality of multigrid methods for FEA, the application of these methods to IGA discretizations has not been unnoticed. We firmly think that they are a very promising approach as efficient and robust solvers for IGA and therefore in this thesis we are concerned about their application. In order to give a theoretical support to the design of multigrid solvers, local Fourier analysis (LFA) is proposed as the main quantitative analysis. Although different scalar problems are also considered along this thesis, we make a special focus on poroelasticity problems. More concretely, we focus on the quasi-static Biot's equations for the soil consolidation process. Nowadays, it is a very challenging task to achieve robust multigrid solvers for poroelasticity problems with respect physical parameters and/or the mesh size. Thus, the main contribution of this thesis is to propose robust multigrid methods for isogeometric discretizations applied to poroelasticity problems. The first part of this thesis is devoted to the introduction of the parametric construction of curves and surfaces since these techniques are the basis of IGA. Hence, with the definition of Bernstein polynomials and B\'ezier curves as a starting point, we introduce B-splines and non-uniform rational B-splines (NURBS) since these will be the basis functions considered for our numerical experiments. The second part deals with the isogeometric analysis. In this part, the isoparametric approach is explained to the reader and the isogeometric analysis of some scalar problems is presented. Hence, the strong and weak formulations by means of Galerkin's method are introduced and the isogeometric approximation spaces as well. The next point of this thesis consists of multigrid methods. The basics of multigrid methods are explained and, besides the presentation of some classical iterative methods as smoothers, block-wise smoothers such as multiplicative and additive Schwarz methods are also introduced. At this point, we introduce LFA for the design of efficient and robust multigrid methods. Furthermore, both standard and infinite subgrids local Fourier analysis are explained in detail together with the analysis for block-wise smoothers and the analysis for systems of partial differential equations. After the introduction of isogeometric discretizations, multigrid methods as our choice of solvers and LFA as theoretical analysis, our goal is to design efficient and robust multigrid methods with respect to the spline degree for IGA discretizations of some scalar problems. Hence, we show that the use of multigrid methods based on multiplicative or additive Schwarz methods provide a good performance and robust asymptotic convergence rates. The last part of this thesis is devoted to the isogeometric analysis of poroelasticity. For this task, Biot's model and its isogeometric discretization are introduced. Moreover, we present an innovative mass stabilization of the two-field formulation of Biot's equations that eliminates all the spurious oscillations in the numerical approximation of the pressure. Then, we deal with two types of solvers for these poroelastic equations: Decoupled and monolithic solvers. In the first group we devote special attention to the fixed-stress split method and a mass stabilized iterative scheme proposed by us that can be automatically applied from the mass stabilization formulation mentioned before. In addition, we perform a von Neumann analysis for this iterative decoupled solver applied to Terzaghi's problem and demonstrate that it is stable and convergent for pairs Q1-Q1, Q2-Q1 and Q3-Q2 (with global smoothness C1). Regarding the group of monolithic solvers, we propose multigrid methods based on coupled and decoupled smoothers. Coupled additive Schwarz methods are proposed as coupled smoothers for isogeometric Taylor-Hood elements. More concretely, we propose a 51-point additive Schwarz method for the pair Q2-Q1. In the last part, we also propose to use an inexact version of the fixed-stress split algorithm as decoupled smoother by applying iterations of different additive Schwarz methods for each variable. For the latter approach, we consider the pairs of elements Q2-Q1 and Q3-Q2 (with global smoothness C1). Finally, thanks to LFA we manage to design efficient and robust multigrid solvers for the Biot's equations and some numerical results are shown.<br /

Controlling the interpolation of NURBS curves and surfaces

The primary focus of this thesis is to determine the best methods for controlling the interpolation of NURBS curves and surfaces. The various factors that affect the quality of the interpolant are described, and existing methods for controlling them are reviewed. Improved methods are presented for calculating the parameter values, derivative magnitudes, data point spacing and twist vectors, with the aim of producing high quality interpolants with minimal data requirements. A new technique for obtaining the parameter values and derivative magnitudes is evaluated, which constructs a C$^1$ cubic spline with orthogonal first and second derivatives at specified parametric locations. When this data is used to create a C$^2$ spline, the resulting interpolant is superior to those constructed using existing parameterisation and derivative magnitude estimation methods. Consideration is given to the spacing of data points, which has a significant impact on the quality of the interpolant. Existing methods are shown to produce poor results with curves that are not circles. Three new methods are proposed that significantly reduce the positional error between the interpolant and original geometry. For constrained surface interpolation, twist vectors must be estimated. A method is proposed that builds on the Adini method, and is shown to have improved error characteristics. In numerical tests, the new method consistently outperforms Adini. Interpolated surfaces are often required to join together smoothly along their boundaries. The constraints for joining surfaces with parametric and geometric continuity are discussed, and the problem of joining $N$ patches to form an $N$-sided region is considered. It is shown that regions with odd $N$ can be joined with G$^1$ continuity, but those with even $N$ or requiring G$^2$ continuity can only be obtained for specific geometries