Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for tetrahedralization of a hexahedral complex is the marching tetrahedron algorithm which limits pre-selection of face divisions. We generalize a procedure for tetrahedralizing triangular prisms to tetrahedralizing cubes, and combine it with certain heuristics to design an algorithm that can triangulate any hexahedra.

翻译：计算模层中三维元素的两个重要类别是六希拉和四希拉。虽然存在几种有效的方法将六向元素转换成四面形元素,但六面形综合体四向化的现有算法是四面形算法,它限制面部分数的预选。我们把四向三角棱柱程序概括为四面形立方体,并将它与某些超常法结合起来,设计一种可以对任何六面形进行三角三角组合的算法。