Two-dimensional unstructured triangular grid generation

Abstract

The capability of generating 2-D unstructured triangular meshes about arbitrary geometries is demonstrated. This work uses a distribution of boundary points and triangulates the computational domain using a Delaunay triangulation algorithm. Typically, initial cells are added based on cell aspect ratios or cell areas. A resulting mesh can then be used along with the connectivity of the cells to solve either a Euler or Navier-Stokes flow problem.