CGAL 4.4 - 2D Conforming Triangulations and Meshes
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Delaunay_mesh_size_criteria_2< CDT > Class Template Reference

#include <CGAL/Delaunay_mesh_size_criteria_2.h>

Definition

The class Delaunay_mesh_size_criteria_2 is a model for the MeshingCriteria_2 concept.

The shape criterion on triangles is given by a bound B such that for good triangles rlB where l is the shortest edge length and r is the circumradius of the triangle. By default, B=2, which is the best bound one can use with the guarantee that the refinement algorithm will terminate. The upper bound B is related to a lower bound αmin on the minimum angle in the triangle:

sinαmin=12B

so B=2 corresponds to αmin20.7 degrees.

This traits class defines also a size criteria: all segments of all triangles must be shorter than a bound S.

Template Parameters
CDTmust be a 2D constrained Delaunay triangulation.
Is Model Of:
MeshingCriteria_2
Examples:
Mesh_2/mesh_class.cpp, Mesh_2/mesh_global.cpp, and Mesh_2/mesh_with_seeds.cpp.

Creation

 Delaunay_mesh_size_criteria_2 ()
 Default constructor with B=2. More...
 
 Delaunay_mesh_size_criteria_2 (double b=0.125, double S=0)
 Construct a traits class with bound B=14b. More...
 

Constructor & Destructor Documentation

Default constructor with B=2.

No bound on size.

template<typename CDT >
CGAL::Delaunay_mesh_size_criteria_2< CDT >::Delaunay_mesh_size_criteria_2 ( double  b = 0.125,
double  S = 0 
)

Construct a traits class with bound B=14b.

If S0, the size bound is S. If S=0, there is no bound on size.