I present an algorithm that can create a mesh that is free of slivers away from the boundary, or that can eliminate such slivers from a pre-existing mesh by refining it. The resulting tetrahedra have dihedral angles between 30 and 135 degrees and radius-edge ratios of at most 1.368, except near the boundary. In comparison, previous bounds on dihedral angles were microscopic. The final mesh can respect specified input vertices and a user-defined sizing function. The algorithm comes with a bound on the sizes of the features it creates, and can provably grade from small to large tetrahedra.
['François Labelle']
SLIVER REMOVAL BY LATTICE REFINEMENT