×

Automatic generation of transitional meshes. (English) Zbl 1047.74058

From the summary: The paper presents a method for stitching together two three-dimensional meshes with diverse elements that can include tetrahedral, pentahedral and hexahedral solid finite elements. The stitching produces a mesh that coincides with the edges which already exist on the portion of boundaries that will be joined. Moreover, the transitional mesh does not introduce new edges on these boundaries. Since the boundaries of the regions to be stitched together can have a mixture of triangles and quadrilaterals, tetrahedral and pyramidal elements provide the transitional elements required to honor these constraints. On these boundaries a pyramidal element shares its base face with the quadrilateral faces of hexahedra and pentahedra. Tetrahedral elements share a face with the triangles on the boundary. Tetrahedra populate the remaining interior of the transitional region.

MSC:

74S05 Finite element methods applied to problems in solid mechanics
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Stitching together tetrahedral meshes. In Geometric Aspects of Industrial Design, (eds). SIAM: Philadelphia, PA, 1992; 25-38.
[2] Shephard, Applied Mechanics Reviews 41 pp 169– (1988) · doi:10.1115/1.3151889
[3] Cline, SIAM Journal of Numerical Analysis 27 pp 1305– (1990) · Zbl 0714.65024 · doi:10.1137/0727074
[4] Sapidis, Computer Aided Geometric Design 8 pp 421– (1991) · Zbl 0743.65110 · doi:10.1016/0167-8396(91)90028-A
[5] Field, Communications in Numerical Methods in Engineering 11 pp 191– (1995) · Zbl 0817.65153 · doi:10.1002/cnm.1640110302
[6] Frey, International Journal for Numerical Methods in Engineering 31 pp 1121– (1991) · Zbl 0825.73812 · doi:10.1002/nme.1620310607
[7] Joe, Computer Aided Geometric Design 8 pp 123– (1991) · Zbl 0729.65120 · doi:10.1016/0167-8396(91)90038-D
[8] A surface Delaunay triangulation algorithm. General Motors Research Publication, GMR-5819, 1987.
[9] A generic Delaunay triangulation algorithm for finite element meshes. Advances in Engineering Software, 1991; 13:263-272. · Zbl 0754.65094
[10] Computational Geometry. Springer: Berlin, 1985. · Zbl 0575.00022 · doi:10.1007/978-1-4612-1098-6
[11] Cavendish, International Journal for Numerical Methods in Engineering 21 pp 329– (1985) · Zbl 0573.65090 · doi:10.1002/nme.1620210210
[12] Field, Communications in Applied Numerical Methods 4 pp 709– (1988) · Zbl 0664.65107 · doi:10.1002/cnm.1630040603
[13] Implementing Watson’s algorithm in three dimensions. Proceedings of the 2nd Annual ACM Symposium on Computational Geometry 1986; 246-259.
[14] Field, International Journal for Numerical Methods in Engineering 47 pp 887– (2000) · Zbl 0944.65125 · doi:10.1002/(SICI)1097-0207(20000210)47:4<887::AID-NME804>3.0.CO;2-H
[15] Robinson, Finite Elements in Analysis and Design 16 pp 43– (1994) · Zbl 0817.73065 · doi:10.1016/0168-874X(94)90039-6
[16] Watson’s Delaunay triangulation without a polygon, General Motors Research Publication, GMR-5140, 1985.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.