SMOOTH
There are nine smoothing algorithms available. esug, elliptic and random are for 2D grids, laplace, aspect and lpfilter for 2D or 3D grids, mega, network and geometry are for 3D grids:
1. esug --- Elliptic Smoothing for Unstructured Grids. This is
the default for 2D mesh objects. It can only be used on triangular 2D mesh
objects. (Ref.: Ahmed Khamayseh and Andrew Kuprat, "Anisotropic
Smoothing and Solution Adaption for Unstructured Grids", Int. J. Num.
Meth. Eng., Vol. 39, pp. 3163-3174 (1996).)
2.elliptic --- Similar to esug but the 'guards' which prevent
a grid from folding are turned off. (Thus esug is preferred.)
3. random -- a node's position is set to a randomly weighted
average position of its neighbors. 'Guards' keep the elements from inverting.
4. laplace ---On a 3D tetahedral mesh moves a node to the average
position of its neighbors where neighbor is defined as the set of nodes
connected to the candidate node by an edge where the node types (itp1)
and node constraints (icr1) are a 'subset' of the candidate node type and
constraints. A node will not be moved if the result is an inverted
element. The following controls may be supplied:
rlxwt default(0.5) |
weight for underrelaxed Laplacian smothing |
ntimes default(5) |
number of smoothing iterations |
nwttry default(3) |
number of attempts to not tangle the mesh by halving the smoothing weight. |
useisn default(1) |
1 means interface nodes are smoothed based alonga multimaterial edge with all the same materials as the candidate node. 0 means interface nodes are smoothed based on all interface neighbors |
extrnbr default(inclusive) |
inclusive means do not restrict neighbors |