Unstructured grid generation using the distance function

A new class of methods for obtaining level sets to generate unstructured grids is presented. The consecutive grid levels are computed using the distance functions, which corresponds to solving the Hamilton-Jacobi equations representing the equations of motion of fronts propagating with curvature-dependent speed. The relationship between the distance function and the governing equations will be discussed as well as its application to generating grids. Multi-ply connected domains and complex geometries are handled naturally, with a straightforward generalization to several space dimensions. The grid points for the unstructured grid are obtained simultaneously with the grid levels. The search involved in checking for overlapping triangles is minimized by triangulating the entire domain one level at a time.