title: Quality Tetrahedral Mesh Smoothing via Boundary-Optimized Delaunay Triangulation.
abstract: Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing "bad" triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In our method, both inner and boundary vertices are repositioned by analytically minimizing the  error between a paraboloid function and its piecewise linear interpolation over the neighborhood of each vertex. In addition to the guaranteed volume-preserving property, the proposed algorithm can be readily adapted to preserve sharp features in the original mesh. A number of experiments are included to demonstrate the performance of our method.
authors.affiliation: Department of Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53211, USA ; College of Computer Science and Technology, Jilin University, Changchun, Jilin 130012, China.
authors.forename: Zhanheng
authors.initials: Z
authors.lastname: Gao
authors.forename: Zeyun
authors.initials: Z
authors.lastname: Yu
authors.forename: Michael
authors.initials: M
authors.lastname: Holst