\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.8 - 2D Conforming Triangulations and Meshes

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Namespaces | Classes | Enumerations | Functions
CGAL Namespace Reference

## Namespaces
| Mesh_2

## Classes
class | Delaunay_mesh_criteria_2
| The class `Delaunay_mesh_criteria_2` is a model for the `MeshingCriteria_2` concept. More...
class | Delaunay_mesh_face_base_2
| The class `Delaunay_mesh_face_base_2` is a model for the concept `DelaunayMeshFaceBase_2`. More...
class | Delaunay_mesh_size_criteria_2
| The class `Delaunay_mesh_size_criteria_2` is a model for the `MeshingCriteria_2` concept. More...
class | Delaunay_mesh_vertex_base_2
| The class `Delaunay_mesh_vertex_base_2` is a model for the concept `DelaunayMeshVertexBase_2`. More...
class | Delaunay_mesher_2
| This class implements a 2D mesh generator. More...
class | Triangulation_conformer_2
| The class `Triangulation_conformer_2` is an auxiliary class of `Delaunay_mesher_2<CDT>`. More...

## Enumerations
enum | Mesh_optimization_return_code { BOUND_REACHED = 0, TIME_LIMIT_REACHED, CANT_IMPROVE_ANYMORE, CONVERGENCE_REACHED, MAX_ITERATION_NUMBER_REACHED, ALL_VERTICES_FROZEN }
| The enum `Mesh_optimization_return_code` is the output of the global mesh optimization functions. More...

## Functions
template<class CDT , class Criteria >
void | refine_Delaunay_mesh_2 (CDT &t, const Criteria &criteria=Criteria())
| Refines the default domain defined by a constrained Delaunay triangulation without seeds into a mesh satisfying the criteria defined by the traits `criteria`. More...
template<class CDT , class Criteria , class InputIterator >
void | refine_Delaunay_mesh_2 (CDT &t, InputIterator begin, InputIterator end, const Criteria &criteria=Criteria(), bool mark=false)
| Refines the default domain defined by a constrained Delaunay triangulation into a mesh satisfying the criteria defined by the traits `criteria`.The sequence `[begin, end)` gives a set of seeds points, that defines the domain to be meshed as follows. More...
template<typename CDT , typename PointIterator >
Mesh_optimization_return_code | lloyd_optimize_mesh_2 (CDT &cdt, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.001, double parameters::freeze_bound=0.001, PointIterator parameters::seeds_begin=PointIterator(), PointIterator parameters::seeds_end=PointIterator(), bool parameters::mark=false)
| The function `lloyd_optimize_mesh_2()` is a mesh optimization process based on the minimization of a global energy function. More...
template<class CDT >
void | make_conforming_Delaunay_2 (CDT &t)
| Refines the constrained Delaunay triangulation `t` into a conforming Delaunay triangulation. More...
template<class CDT >
void | make_conforming_Gabriel_2 (CDT &t)
| Refines the constrained Delaunay triangulation `t` into a conforming Gabriel triangulation. More...