Tetrahedral Mesh Improvement, Algorithms and Experiments

Abstract

111 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted Delaunay mesh. This is referred to as the sliver exudation algorithm. Their theoretical bound on the achieved minimum mesh quality is a constant that is positive but exceedingly small. We perform computational experiments to testify the practical effectiveness of sliver exudation.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD