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.
CITATION STYLE
Jampani, R., & Üngör, A. (2008). Construction of sparse well-spaced point sets for quality tetrahedralizations. In Proceedings of the 16th International Meshing Roundtable, IMR 2007 (pp. 63–80). https://doi.org/10.1007/978-3-540-75103-8_4
Mendeley helps you to discover research relevant for your work.