There are 174 Triangulations of the Hexahedron

01/04/2018
by   Jeanne Pellerin, et al.
0

This article answers an important theoretical question: How many different subdivisions of the hexahedron into tetrahedra are there? It is well known that a cube has five subdivisions into 6 tetrahedra and one subdivision into 5 tetrahedra. However, all hexahedra are not cubes and moving vertex positions increases the number of subdivisions. Recent hexahedral dominant meshing methods try to take these configurations into account for combining tetrahedra into hexahedra, but fail to enumerate them all: they use only a set of 10 subdivisions among the 174 we found in this article. The enumeration of these 174 subdivisions of the hexahedron into tetrahedra is our main result. Each of the 174 triangulations has between 5 and 15 tetrahedra and is actually a class of 2 to 48 equivalent instances which are identical up to vertex relabeling. This result is purely combinatorial. We also demonstrate that a minimum of 114 triangulations do correspond to hexahedron geometrical triangulations. Each hexahedron is valid for finite element computations (strictly positive Jacobian determinant). We exhibit the tetrahedral meshes for these geometries and show in particular triangulations of the hexahedron with 14 tetrahedra.

READ FULL TEXT

page 1

page 7

research
01/04/2018

Enumerating combinatorial triangulations of the hexahedron

Most indirect hexahedral meshing methods rely on 10 patterns of subdivis...
research
09/02/2019

Gibbs Phenomena for L^q-Best Approximation in Finite Element Spaces -- Some Examples

Recent developments in the context of minimum residual finite element me...
research
08/11/2020

A General Superapproximation Result

A general superapproximation result is derived in this paper which is us...
research
07/13/2019

Variable degeneracy on toroidal graphs

Let f be a nonnegative integer valued function on the vertex-set of a gr...
research
01/25/2021

Constant Amortized Time Enumeration of Eulerian trails

In this paper, we consider enumeration problems for edge-distinct and ve...
research
07/13/2019

Cover and variable degeneracy

Let f be a nonnegative integer valued function on the vertex-set of a gr...

Please sign up or login with your details

Forgot password? Click here to reset