CGAL 5.1 - 2D Conforming Triangulations and Meshes
2D Conforming Triangulations and Meshes Reference

Laurent Rineau
This package implements a Delaunay refinement algorithm to construct conforming triangulations and 2D meshes. Conforming Delaunay triangulations are obtained from constrained Delaunay triangulations by refining constrained edges until they are Delaunay edges. Conforming Gabriel triangulations are obtained by further refining constrained edges until they become Gabriel edges. The package provides also a 2D mesh generator that refines triangles and constrained edges until user defined size and shape criteria on triangles are satisfied. The generated meshes can be optimized using the Lloyd algorithm, also provided in this package. The package can handle intersecting input constraints and set no restriction on the angle formed by two constraints sharing an endpoint.
Introduced in: CGAL 3.1
Depends on: PkgTriangulation2
BibTeX: cgal:r-ctm2-21b
License: GPL
Windows Demo: 2D Mesh Generator
Common Demo Dlls: dlls

Classified Reference Pages

Concepts

Classes

Global Functions

I/O Functions

Enumerations

Modules

 Concepts
 
 Mesh Generation Functions
 
 Enumerations
 
 I/O Functions
 

Classes

class  CGAL::Delaunay_mesh_criteria_2< CDT >
 
class  CGAL::Delaunay_mesh_face_base_2< Traits, Fb >
 
class  CGAL::Delaunay_mesh_size_criteria_2< CDT >
 
class  CGAL::Delaunay_mesh_vertex_base_2< Traits, Vb >
 
class  CGAL::Delaunay_mesher_2< CDT, Criteria >
 
class  CGAL::Triangulation_conformer_2< CDT >
 

Enumerations

enum  CGAL::Mesh_2::Face_badness { CGAL::Mesh_2::NOT_BAD, CGAL::Mesh_2::BAD, CGAL::Mesh_2::IMPERATIVELY_BAD }
 

Enumeration Type Documentation

◆ Face_badness

#include <CGAL/Mesh_2/Face_badness.h>

Enumerator
NOT_BAD 
BAD 
IMPERATIVELY_BAD