GradH‐Correction: guaranteed sizing gradation in multi‐patch parametric surface meshing

In this paper a new method, called GradH‐Correction, for the generation of multi‐patch parametric surface meshes with controlled sizing gradation is presented. Such gradation is obtained performing a correction on the size values located on the vertices of the background mesh used to define the control space that governs the meshing process. In the presence of a multi‐patch surface, like shells of BREP solids, the proposed algorithm manages the whole composite surface simultaneously and as a unique entity. Sizing information can spread from a patch to its adjacent ones and the resulting size gradation is independent from the surface partitioning. Theoretical considerations lead to the assertion that, given a parameter λ, after performing a GradH‐Correction of level λ over the control space, the unit mesh constructed using the corrected control space is a mesh of gradation λ in the real space (target space). This means that the length ratio of any two adjacent edges of the mesh is bounded between 1/λ and λ. Numerical results show that meshes generated from corrected control spaces are of high quality and good gradation also when the background mesh has poor quality. However, due to mesh generator imprecision and theoretical limitations, guaranteed gradation is achieved only for the sizing specifications and not for the generated mesh. Copyright © 2004 John Wiley & Sons, Ltd.     

Global parameterization of a topological surface defined as a collection of trimmed bi‐parametric patches: Application to automatic mesh construction

We describe a new geometric algorithm to map surfaces into a plane convex area. The mapping transformation is bijective; it redefines the whole surface as a unique bi‐parametric patch. Thus this mapping provides a global parametrization of the surface. The surfaces are issued from industrial CAD software; they are usually described by a large number of patches and there are many shortcomings. Indeed, the decomposition into patches depends on the algorithm of the geometric modelling system used for design and usually has no meaning for any technological application. Moreover, in many cases, the surface definition is not compatible, i.e. patches are not well connected, some patches are self‐intersecting or intersect each other. Many applications are hard to address because of these defects. In this paper we show how patch‐independent meshing techniques may be easily automated using a unique metric in a plane parametric space. Thus we provide an automatic procedure to build valid meshes over free‐form surfaces issued from industrial CAD software (Computer Aided Design: this terminology should refer to a large amount of software. For the scope of this paper we only refer to geometric modelling systems. Indeed geometric modelling systems remain the kernel of many CAD software). Copyright © 2002 John Wiley & Sons, Ltd.     

On curvature element‐size control in metric surface mesh generation

A new procedure is suggested for controlling the element‐size distribution of surface meshes during automatic adaptive surface mesh generation. In order to ensure that the geometry of the surface can be accurately captured, the curvature properties of the surface are first analysed. Based on the principal curvatures and principal directions of the surface, the curvature element‐size requirement is defined in the form of a metric tensor field. This element‐size controlling metric tensor field, which can either be isotopic or anisotopic depending on the user requirement, is then employed to control the element size distribution during mesh generation. The suggested procedure is local, adaptive and can be easily used with many parametric surface mesh generators. As the proposed scheme defines the curvature element‐size requirement in an implicit manner, it can be combined with any other user defined element size specification using the standard metric intersection procedure. This eventually leads to a simple implementation procedure and a high computational efficiency. Numerical examples indicate that the new procedure can effectively control the element size of surfacemeshes in the cost of very little additional computational effort. Copyright © 2001 John Wiley & Sons, Ltd.     

A new fast hybrid adaptive grid generation technique for arbitrary two‐dimensional domains

This paper describes a new fast hybrid adaptive grid generation technique for arbitrary two‐dimensional domains. This technique is based on a Cartesian background grid with square elements and quadtree decomposition. A new algorithm is introduced for the distribution of boundary points based on the curvature of the domain boundaries. The quadtree decomposition is governed either by the distribution of the boundary points or by a size function when a solution‐based adaptive grid is desired. The resulting grid is quaddominant and ready for the application of finite element, multi‐grid, or line‐relaxation methods. All the internal angles in the final grid have a lower bound of 45° and an upper bound of 135°. Although our main interest is in grid generation for unsteady flow simulations, the technique presented in this paper can be employed in many other fields. Several application examples are provided to illustrate the main features of this new approach. Copyright © 2010 John Wiley & Sons, Ltd.     

Implicit boundary method for finite element analysis using non‐conforming mesh or grid

In the finite element method (FEM), a mesh is used for representing the geometry of the analysis and for representing the test and trial functions by piece‐wise interpolation. Recently, analysis techniques that use structured grids have been developed to avoid the need for a conforming mesh. The boundaries of the analysis domain are represented using implicit equations while a structured grid is used to interpolate functions. Such a method for analysis using structured grids is presented here in which the analysis domain is constructed by Boolean combination of step functions. Implicit equations of the boundary are used in the construction of trial and test functions such that essential boundary conditions are guaranteed to be satisfied. Furthermore, these functions are constructed such that internal elements, through which no boundary passes, have the same stiffness matrix. This approach has been applied to solve linear elastostatic problems and the results are compared with analytical and finite element analysis solutions to show that the method gives solutions that are similar to the FEM in quality but is less computationally expensive for dense mesh/grid and avoids the need for a conforming mesh. Copyright © 2007 John Wiley & Sons, Ltd.