On degeneration of tetrahedra under longest-edge n-section refinement

Abstract

For every integer $n \ge 2$, we construct explicit tetrahedral counterexamples showing that repeated longest-edge (LE) n-section refinement does not, in general, preserve shape regularity, contrary to long-standing conjectural expectations. For $n = 2$, the construction disproves the finite-family conjecture put forward by Adler in 1983 and the non-degeneracy conjecture for tetrahedral longest-edge bisection formulated by Rivara and Levin in 1992. It also shows that the sharper higher-dimensional diameter decay suggested by Stynes in 1983,following his 1980 planar finite-similarity result, cannot hold for arbitrary tetrahedra. For $n = 3$, it disproves the published non-degeneracy conjecture for tetrahedral longest-edge trisection formulated in 2011 by Suárez, Abellón, Abad and Plaza on the basis of numerical experiments. The resulting infinite descendant sequences violate both the minimum and maximum angle conditions. For $n \ge 3$, the selected edge is always the unique longest edge at every refinement step. The two-step recurrence used in the construction exhibits two distinct degeneration behaviors: a flat-tetrahedron regime for $2 \le n \le 5$ and a skinny-tetrahedron regime for $n \ge 6$. The degenerating sequences can also be realized within conforming partitions generated by the conforming LE n-section algorithm. For both the classical and the conforming LE n-section algorithms, the maximal element diameter tends to zero as the number of refinement steps tends to infinity, regardless of which longest edge is chosen. Thus diameter convergence, and even conformity, do not prevent shape degeneration. These algorithms should therefore be used with care in applications requiring uniform shape regularity.