carrier image

Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations

Jampani, Ravi and Alper Ungor

Proceedings, 16th International Meshing Roundtable, Springer-Verlag, pp.63-80, October 14-17 2007

IMR
PROCEEDINGS

16th International Meshing Roundtable
Seattle, Washington, U.S.A.
October 14-17, 2007

Dept. of Computer & Information Science & Engineering
University of Florida
{rjampani,ungor}@cise.ufl.edu

Abstract
We propose a new mesh refinement algorithm for computing quality guaranteed Delaunay triangulations in three dimensions. The refinement relies on new ideas for computing the goodness of the mesh, and a sampling strategy that employs numerically stable Steiner points. We show through experiments that the new algorithm results in sparse well-spaced point sets which in turn leads to tetrahedral meshes with fewer elements than the traditional refinement methods.

Download Full Paper (PDF Format)


Contact author(s) or publisher for availability and copyright information on above referenced article