The longest-edge bisection algorithm may produce degenerating tetrahedra

An explicit sequence of tetrahedra generated by the longest-edge bisection algorithm is shown to degenerate. The example violates shape regularity and both the minimum- and maximum-angle conditions, demonstrating that arbitrary tie-breaking among longest edges does not guarantee nondegeneration.