Cutting Tetrahedra by Node Identifiers

This report briefly outlines an algorithm for dividing a tetrahedron intersected by a planar interface into conforming sub-tetrahedra. The problem of conformal decomposition of tetrahedral meshes arises in enriched finite element methods; in particular, we are concerned with the Conformal Decomposition Finite Element Method (CDFEM) and variants of the eXtended Finite Element Method (XFEM). The algorithm presented is based on the paper How to Subdivide Pyramids, Prisms and Hexahedra into Tetrahedra by Dompierre, Labbe, Vallet, and Camarero (1999), and here is applied and extended to the problem of fully defining and tracking all geometric features of the sub-tetrahedra generated when a tetrahedron is cut by a planar surface.