An Automatic Method for Complete Triangular Mesh Conversion into Quadrilateral Mesh for Multiple Domain Geometry (original) (raw)
Related papers
2014
This paper describes a scheme for finite element mesh generation of a convex, non-convex polygon and multiply connected linear polygon. We first decompose the arbitrary linear polygon into simple sub regions in the shape of polygons.These subregions may be simple convex polygons or cracked polygons.We can divide a nonconvex polygon into convex polygons and cracked polygons We then decompose these polygons into simple sub regions in the shape of triangles. These simple regions are then triangulated to generate a fine mesh of triangular elements. We propose then an automatic triangular to quadrilateral conversion scheme. Each isolated triangle is split into three quadrilaterals according to the usual scheme, adding three vertices in the middle of the edges and a vertex at the barrycentre of the element. To preserve the mesh conformity a similar procedure is also applied to every triangle o f the domain to fully discretize the given convex polygonal domain into all quadrilaterals, thus...
A New Triangular Mesh Generation Technique
International Journal of Machine Learning and Computing
Objective of this paper is to propose a new semi-automatic, adaptive and optimized triangular mesh generation technique for any domain (including free formed curves). This new technique is found by merging the generalised equations which were proposed in previous works with Delaunay triangulation method. The new technique is demonstrated for several domains with various boundaries. Initial meshes are generated for these domains, which are later optimized manually by addition, removal or replacement of sampling points. Finalized meshes consist of triangular elements with aspect ratio of less than 2 and minimum skewness of more than 45 degrees.
Automatic conversion of triangular meshes into quadrilateral meshes with directionality
2001
This paper presents a triangular-to-quadrilateral mesh conversion method that can control the directionality of the output quadrilateral mesh according to a user-specified vector field. Given a triangular mesh and a vector field, the method first scores all possible quadrilaterals that can be formed by pairs of adjacent triangles, according to their shape and directionality. It then converts the pairs into quadrilateral elements in order of the scores to form a quadrilateral mesh. Engineering analyses with finite element methods occasionally require a quadrilateral mesh well aligned along the boundary geometry or the directionality of some physical phenomena, such as in the directions of a streamline, shock boundary, or force propagation vectors. The mesh conversion method can control the mesh directionality according to any desired vector fields, and the method can be used with any existing triangular mesh generators.
Side based Automatic Mesh generation scheme for a general convex domain with quadrilaterals
IOSR Journals , 2019
This article includes an automatic mesh generation scheme foran arbitrary convex domain constituted by straight lines or curves employing lower or higher-order quadrilateral finite elements.First, we develop the general algorithm for hand p-version meshes, which require the information of sides of the domain and the choice of the order as well as the type of elements.The method also allows one to form the desired fine mesh by providing the number of refinements. Secondly, we develop the MATLAB program based on the algorithm that provides all the valuable and needful outputs of the nodal coordinates, relation between local and global nodes of the elements, and displays the desired meshes. Finally, we substantiate the suitability and efficiency of the scheme through the demonstration of several test cases of mesh generation. We firmly believe that the automatic hand p-version mesh generation scheme employing the quadrilateral elements will find immense application in the FEM solution procedure.
Geometry-based fully automatic mesh generation and the delaunay triangulation
International Journal for Numerical Methods in Engineering, 1988
One approach to fully automatic mesh generation in two and three dimensions is to generate and triangulate a set of points within and on the boundary of a geometry using the properties of the Delaunay triangulation. Because the point data generate mesh topology of greater dimension, it is necessary to insure topological compatibility and perform classification of the resulting mesh with respect to the original geometry.
A scheme for the automatic generation of triangular finite elements
International Journal for Numerical Methods in Engineering, 1980
This paper describes a method for the automatic triangulation of arbitrary multilateral plane domains. In addition, the method can be used in connection with that suggested by Zienkiewicz and Phillips' for the subdivision of curved-boundary domains. The method can be described as general fully automatic and computer oriented. A Fortran computer program has been prepared by the author. Output can be of interactive, graphical or alphanumerical form. The program has been applied to a number of cases. The resulting triangulations are always satisfactory, even when vigorous changes of mesh sizes are encountered.
An improved procedure for 2D unstructured Delaunay mesh generation
Advances in Engineering Software, 2003
This paper presents a procedure for the discretization of 2D domains using a Delaunay triangulation. Improvements over existing similar methods are introduced, proposing in particular a multi-constraint insertion algorithm, very effective in the presence of highly irregular domains, and the topological structure used together with its primitives. The method obtained requires limited input and can be applied to a wide class of domains. Quadrilateral subdivisions with a control of the aspect ratio of the generated elements can also be reached. Further it is suitable for evolutionary problems, which require continuous updating of the discretization. Presented applications and comparisons with other discretization methods demonstrate the effectiveness of the procedure. q
Quadrilateral Mesh Generation using Templates
This paper describes a quadrilateral mesh generation algorithm ideally suited for transition subdomain meshes in the context of any domain decomposition meshing strategy. The algorithm is based on an automatic hierarchical region decomposition in which, in the last level, it is possible to generate quadrilateral elements with a conventional mapping strategy. In two dimensions, a subdomain is usually a triangle or a rectangle. In this algorithm, a subdomain with two boundary curves may also be allowed. Templates impose restrictions on the number of boundary curve segments of a subdomain to be meshed. The proposed hierarchical template scheme eliminates these restrictions, requiring only an even number of boundary segments. Other algorithms in the literature present similar characteristics. However, the implementation of the hierarchical decomposition and its templates presented here is quite simple compared to other approaches. Six high-level templates are considered for a subdomain, depending on the number of boundary curves and the number of segments on each curve. Several examples demonstrate that this simple idea may result in structured meshes of surprisingly good quality. We also show the possibility of obtaining different meshes for a subdomain with fixed boundary discretization by changing the corners between curves.