TOPICS
Search

Tetrahedral Mesh


A tetrahedral mesh is a three-dimensional mesh whose maximal cells are tetrahedra. In a conforming tetrahedral mesh, two tetrahedra meet, if at all, in a complete common face, polyhedron edge, or polyhedron vertex.

Tetrahedral meshes discretize three-dimensional domains for the finite element method. Their quality is controlled by geometric conditions such as ratios of characteristic lengths and dihedral angles, and they are commonly constructed by mesh generation algorithms based on Delaunay triangulation.

Bern et al. (1995) gave an angle-based classification of tetrahedra into six types according to their small and large solid angles and dihedral angles. Cheng et al. (1999, p. 3) distinguished this from their classification based primarily on the angles within the faces, which gives the nine nearly degenerate types illustrated below.

For meshes intended to have comparable resolution in all directions, well-proportioned tetrahedra are often preferred to nearly degenerate ones. The following tables illustrate two well-shaped examples and a classification of skinny and nearly flat examples (Cheng et al. 2012, pp. 24-25; Hannukainen et al. 2017, p. 3). Here "round" describes a well-proportioned example rather than a separate mathematical class. The skinny and nearly flat classifications are qualitative; their names do not prescribe numerical mesh quality values.

The first table shows well-shaped examples.

representativeshapegeometric feature
TetrahedralMeshTableRegular
regular tetrahedronsix equal edges
TetrahedralMeshTableRound
round (well-shaped)comparable dimensions; not necessarily regular

The skinny examples approach a line. The names spire and needle are synonyms in this classification.

representativeshapegeometric feature
TetrahedralMeshTableSpire
spire (needle)three vertices near one endpoint
TetrahedralMeshTableSplinter
splintertwo separated close vertex pairs
TetrahedralMeshTableSpindle
spindlefour distinct positions along a line
TetrahedralMeshTableSpear
spearclose vertex pair near the middle
TetrahedralMeshTableSpike
spikeclose vertex pair near an endpoint

The nearly flat examples approach a plane.

representativeshapegeometric feature
TetrahedralMeshTableWedge
wedgetwo vertices close together
TetrahedralMeshTableSpade
spadeone vertex near an opposite edge
TetrahedralMeshTableCap
capone vertex near the opposite face interior
TetrahedralMeshTableSliver
sliverfour almost coplanar vertices with quadrilateral projection

Mesh quality depends on the application. Some directionally stretched elements, including spires with suitable dihedral angles, can be useful. Comparable edge lengths alone do not exclude a sliver (Cheng et al. 2012, pp. 25-26).

These shape distinctions can guide mesh quality improvement. For example, the method of Gao et al. (2012) handles spade, cap, and sliver tetrahedra by inserting one or two additional vertices before repositioning vertices to improve the resulting elements.


See also

Conforming Mesh, Delaunay Triangulation, Finite Element Method, Mesh, Mesh Generation, Mesh Quality, Tetrahedron, Triangulation

Explore with Wolfram|Alpha

References

Bern, M.; Chew, L. P.; Eppstein, D.; and Ruppert, J. "Dihedral Bounds for Mesh Generation in High Dimensions." In Proc. Sixth Ann. ACM-SIAM Symp. Discrete Algorithms (Ed. K. Clarkson). Philadelphia, PA: SIAM, pp. 189-196, 1995. https://ics.uci.edu/~eppstein/pubs/p-dihedral.html.Bern, M. and Plassmann, P. "Mesh Generation." Ch. 6 in Handbook of Computational Geometry. (Ed. J.-R. Sack and J. Urrutia). Amsterdam, Netherlands: North-Holland, pp. 291-332, 2000.Cheng, S.-W.; Dey, T. K.; Edelsbrunner, H.; Facello, M. A.; and Teng, S.-H. "Sliver Exudation." In Proc. Fifteenth Ann. Symp. Computational Geometry. New York: ACM, pp. 1-13, 1999. https://doi.org/10.1145/304893.304894.Cheng, S.-W.; Dey, T. K.; and Shewchuk, J. R. Delaunay Mesh Generation. Boca Raton, FL: CRC Press, 2012. https://people.eecs.berkeley.edu/~jrs/meshbook.html.Gao, Z.; Yu, Z.; and Holst, M. "Quality Tetrahedral Mesh Smoothing via Boundary-Optimized Delaunay Triangulation." Comput. Aided Geom. Design 29, 707-721, 2012. https://doi.org/10.1016/j.cagd.2012.07.001.Hannukainen, A.; Korotov, S.; and Krížek, M. "On Synge-Type Angle Condition for d-Simplices." Appl. Math. 62, 1-13, 2017. https://doi.org/10.21136/AM.2017.0132-16.

Cite this as:

Weisstein, Eric W. "Tetrahedral Mesh." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TetrahedralMesh.html

Subject classifications