Abstract

Indirect quad mesh generation methods rely on an initial triangular mesh. So called triangle-merge techniques are then used to recombine the triangles of the initial mesh into quadrilaterals. This way, high-quality full-quad meshes suitable for finite element calculations can be generated for arbitrary two-dimensional geometries. In this paper, a similar indirect approach is applied to the three-dimensional case, i.e., a method to recombine tetrahedra into hexahedra. Contrary to the 2D case, a 100% recombination rate is seldom attained in 3D. Instead, part of the remaining tetrahedra are combined into prisms and pyramids, eventually yielding a mixed mesh. We show that the percentage of recombined hexahedra strongly depends on the location of the vertices in the initial 3D mesh. If the vertices are placed at random, less than 50% of the tetrahedra will be combined into hexahedra. In order to reach larger ratios, the vertices of the initial mesh need to be anticipatively organized into a lattice-like structure. This can be achieved with a frontal algorithm, which is applicable to both the two- and three-dimensional cases. The quality of the vertex alignment inside the volumes relies on the quality of the alignment on the surfaces. Once the vertex placement process is completed, the region is tetrahedralized with a Delaunay kernel. A maximum number of tetrahedra are then merged into hexahedra using the algorithm of Yamakawa-Shimada. Non-uniform mixed meshes obtained following our approach show a volumic percentage of hexahedra that usually exceeds 80%. The execution times are reasonable. However, non-conformal quadrilateral faces adjacent to triangular faces are present in the final meshes.

Highlights

  • Indirect quad mesh generation methods rely on an initial triangular mesh

  • The direction d1 of the frame field is computed at the points xb of the boundaries of surface S: d1 is the tangent vector to the boundary

  • This section presents several mixed hex meshes created with the frontal algorithm and Yamakawa-Shimada’s algorithm

Read more

Summary

Methods

We have pointed out above the importance of having the mesh vertices pre-aligned to ensure a good recombination rate. The direction d1 of the frame field is computed at the points xb of the boundaries of surface S: d1 is the tangent vector to the boundary. The dotted square around x1 is the oriented exclusion area of vertex x1, that is computed from the surface cross field (h1d1, h1d2) that has a uniform mesh size field h1. We define an exclusion zone for every vertex that has already been inserted (this includes boundary vertices) This exclusion zone is a parallelogram in the parameter plane (see the yellow parallelogram of Figure 9). These non-conformities can be fixed by Owen-Canann-Saigal’s algorithm [38]. Finite element solvers capable of handling these type of non-conformities are required

Background
Results and discussion
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.