Sliver removal by lattice refinement
François Labelle · 2006
I present an algorithm that can provably eliminate slivers in the interior of a tetrahedral mesh, leaving only tetrahedra with 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.