Quasi-structured anisotropic quad-dominant mesh adaptation using metric-orthogonal approach

International audienceWe present a strategy for the generation of mixed-element quasi-structured meshes. This strategy is based on the tools of metric-based mesh adaptation. Using metricorthogonal point placement, we can generate a pattern of points following the underlying structure of the metric-field, from which we generate a quasi structured triangular or mixed-element mesh. This paper presents some enhancement of the adaptation loop towards the generation of quad-dominant meshes. Especially, since this method highly depends on the prescribed metric-field, we present a tailored gradation process that favors the formation of structured elements. We also explore two processes to recover the quadrilaterals: an indirect method based on combining right triangles from a preliminary orthogonal triangular mesh, and a quadrilateral detection at the point-placement step

Development of a multiblock procedure for automated generation of two-dimensional quadrilateral meshes of gear drives

This article describes a new multiblock procedure for automated generation of two-dimensional quadrilateral meshes of gear drives. The typical steps of the multiblock schemes have been investigated in depth to obtain a fast and simple way to mesh planar sections of gear teeth, allowing local mesh refinement and minimizing the appearance of distorted elements in the mesh. The proposed procedure is completed with two different mesh quality enhancement techniques. One of them is applied before the mesh is generated, and reduces the distortion of the mesh without increasing the computational time of the meshing process. The other one is applied once the mesh is generated, and reduces the distortion of the elements by means of a mesh smoothing method. The performance of the proposed procedure has been illustrated with several numerical examples, which demonstrate its ability to mesh different gear geometries under several meshing boundary conditions

Linear Complexity Hexahedral Mesh Generation

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an additional bipartiteness condition. The same techniques can also be used to reduce the geometric version of the hexahedral mesh generation problem to a finite case analysis amenable to machine solution.Comment: 12 pages, 17 figures. A preliminary version of this paper appeared at the 12th ACM Symp. on Computational Geometry. This is the final version, and will appear in a special issue of Computational Geometry: Theory and Applications for papers from SCG '9

The Modified Direct Method: an Approach for Smoothing Planar and Surface Meshes

The Modified Direct Method (MDM) is an iterative mesh smoothing method for smoothing planar and surface meshes, which is developed from the non-iterative smoothing method originated by Balendran [1]. When smooth planar meshes, the performance of the MDM is effectively identical to that of Laplacian smoothing, for triangular and quadrilateral meshes; however, the MDM outperforms Laplacian smoothing for tri-quad meshes. When smooth surface meshes, for trian-gular, quadrilateral and quad-dominant mixed meshes, the mean quality(MQ) of all mesh elements always increases and the mean square error (MSE) decreases during smoothing; For tri-dominant mixed mesh, the quality of triangles always descends while that of quads ascends. Test examples show that the MDM is convergent for both planar and surface triangular, quadrilateral and tri-quad meshes.Comment: 18 page

Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\'ezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior B\'ezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring B\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\'ezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach