Starting from a mesh and a size/direction map, the mesh is modified to fit with the prescription.
The algorithm is decomposed in two parts. First, the edges lengths are analysed: the long edges are cutted and the short ones are deleted.
Then, when the point density is in agreement with the prescribed size, there is a phase of quality optimization (edges swaps and point relocation).
NB :In the case where there is no prescribed size, we create one with the initial mesh (in analyzing the edges lenghts).
Dobrzynski
2012-03-23