\( \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.10.1 - 2D Triangulation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
ConstrainedDelaunayTriangulationTraits_2 Concept Reference
Concepts

Definition

The concept ConstrainedDelaunayTriangulationTraits_2 defines the requirements for the geometric traits class of a constrained Delaunay triangulation that supports intersections of input constraints. This is the case when the template parameter Itag of CGAL::Constrained_Delaunay_triangulation_2<Traits,Tds,Itag> is instantiated by one of the tag classes CGAL::Exact_intersections_tag or CGAL::Exact_predicates_tag. The concept ConstrainedDelaunayTriangulationTraits_2 refines both the concept DelaunayTriangulationTraits_2 and the concept ConstrainedTriangulationTraits_2.

Refines:

DelaunayTriangulationTraits_2

ConstrainedTriangulationTraits_2

Has Models:

All CGAL Kernels

CGAL::Projection_traits_xy_3<K>

CGAL::Projection_traits_yz_3<K>

CGAL::Projection_traits_xz_3<K>

See Also
TriangulationTraits_2
ConstrainedTriangulationTraits_2
CGAL::Constrained_triangulation_2<Gt,Tds,Itag>
CGAL::Constrained_Delaunay_triangulation_2<Gt,Tds,Itag>