A Comparison of Parametric Space vs . Real Space Triangular Meshing Algorithms

We present a triangulation algorithm that is a hybrid between a Delaunay triangulation and an advancing front algorithm. The Delaunay triangulation is performed in parametric space and Steiner points are inserted based on an advancing front criteria. This Advancing Steiner Point (ASP) algorithm is compared with the three-space advancing front algorithm that is currently implemented in Cubit, a mesh generation tool developed at Sandia National Laboratories. We find that the two algorithms are comparable in both speed and quality on analytic surfaces while the ASP algorithm has significant speed advantages on parametric and complex surfaces.