This class implements a 2D mesh generator.
The geometric traits class of the instance of CDT has to be a model of the concept DelaunayMeshTraits_2.
The template parameter Criteria should be a model of the concept MeshingCriteria_2. This traits class defines the shape and size criteria for the triangles of the mesh. Criteria::Face_handle has to be the same as CDT::Face_handle.
The constructor of the class Delaunay_mesher_2<CDT, Criteria> takes a reference to a CDT as an argument. A call to the refinement method refine_mesh() will refine the constrained Delaunay triangulation into a mesh satisfying the size and shape criteria specified in the traits class. Note that if, during the life time of the Delaunay_mesher_2<CDT, Criteria> object, the triangulation is externally modified, any further call to its member methods may crash. Consider constructing a new Delaunay_mesher_2<CDT, Criteria> object if the triangulation has been modified.
The domain to be mesh is defined by the constrained edges and a set of seed points. The constrained edges divides the plane into several connected components. The mesh domain is either the union of the bounded connected components including at least one seed, or the union of the bounded connected components that do no contain any seed. Note that the unbounded component of the plane is never meshed.
#include <CGAL/Delaunay_mesher_2.h>

 the geometric traits class. 
 
const iterator over defined seeds. Its
value type is Geom_traits::Point_2.

 
Create a new mesher, working on t, with meshing criteria
criteria.

The following functions are used to define seeds.

 Sets seeds to the empty set. All finite connected components of the constrained triangulation will be refined.  
 

 
Sets seeds to the sequence [begin,
end]. If mark=true, the mesh domain
is the union of the bounded connected
components including at least one seed. If
mark=false, the domain is the union of
the bounded components including no seed. Note
that the unbounded component of the plane is
never meshed.
 

 Start of the seeds sequence.  

 Past the end of the seeds sequence. 
advanced 
advanced 
advanced 
The Delaunay_mesher_2<CDT, Criteria> class allows, for debugging or demos, to play the meshing algorithm step by step, using the following methods.

 This method must be called just before the first call to the following step by step refinement method, that is when all vertices and constrained edges have been inserted into the constrained Delaunay triangulation. It must be called again before any subsequent calls to the step by step refinement method if new vertices or constrained edges have been inserted since the last call. 

 Tests if the step by step refinement algorithm is done. If it returns true, the following calls to step_by_step_refine_mesh will not insert any points, until some new constrained segments or points are inserted in the triangulation and init is called again. 

 
Applies one step of the algorithm, by inserting one point, if the algorithm is not done. Returns false iff no point has been inserted because the algorithm is done. 
advanced 