Construction of Three-Dimensional Delaunay Triangulations Using Local Transformations
Joe, Barry
Computer Aided Geometric Design, Elsevier Science Publishers (North-Holland), Num 8, pp.123-142, 1991
Three-dimensional Delaunay triangualtions are the most common form of three- dimensional triangulations known, but they are not very suitable for tetrahedral finite element meshes because they tend to contain poorly shaped sliver tetrahedra. In this paper we present an algorithm for constructing improved-quality triangulation with respect to a tetrahedron shape measure. The algorithm uses combinations of two or more local transformations to improve a given triangulation. A variation of the algorithm for improving a pseudo-locally-optimal non-Delaunay triangulation towards a Delaunay triangulation is also presented.
Contact author(s) or publisher for availability and copyright information on above referenced article