We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured grid and, in particular, the choice of the shape and size control weighting both locally and globally; 2) an analysis of the angle bounds achievable through the new smoothing algorithm under shape control; 3) the extension of the approach to 3D with an application to a 3D grid generated by CUBIT; 4) the use of alternative metrics to provide clustering based on an approximate solution; 5) the treatment of constraints on boundaries and at hanging nodes introduced through adaptive refinement applied in conjunction with interior grid smoothing. The results of numerical studies are included to demonstrate the performance of the resulting schemes.
Larisa Branets, Graham F. Carey