An efficient advancing front algorithm for Delaunay triangulation

There has been some recent interest in fluid dynamics calculations on unstructured meshes. One method of unstructured mesh generation involves Delaunay triangulation. This method has certain advantages but it can be expensive to implement. Furthermore, there can be problems with crossing grid lines near boundaries. A method shown here avoids many of the robustness and efficiency problems previously associated with Delaunay triangulation. As an added feature, a simple algorithm is shown which allows removal of diagonal edges from cells that are nearly rectangular. This can result in significant savings in the cost per iteration of a flow solver using this grid.