Surface Gridding from Discrete Data

Abstract

An advancing front gridding technique that operates on discretely defined surfaces is presented. Different aspects that are required to make the procedure reliable for complex geometries are discussed. Notable among these are:

1. The recovery of surface features and discrete surface patches from the discrete data.
2. Filtering based on point and side normals to remove undesirable data close to cusps and corners.
3. The proper choice of host faces for ridges.
4. Fast interpolation procedures suitable for complex geometries. Post-generation surface recovery or repositioning techniques are discussed. Several examples ranging from academic to industrial demonstrate the utility of the proposed procedure for ab initio surface meshing from discrete data, such as those encountered when the surface description is already given as discrete, the improvement of existing surface triangulations, as well as remeshing applications during runs exhibiting significant change of domain.