CGAL 4.5 - 2D Triangulation: Triangulation Classes

$\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.5 - 2D Triangulation

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

Classes
class	CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
	A constrained Delaunay triangulation is a triangulation with constrained edges which tries to be as much Delaunay as possible. More...

struct	CGAL::No_intersection_tag
	Intersection tag for constrained triangulations, when input constraints do not intersect. More...

struct	CGAL::Exact_intersections_tag
	Intersection tag for constrained triangulations, if an exact predicates and exact constructions are provided. More...

struct	CGAL::Exact_predicates_tag
	Intersection tag for constrained triangulations, if the geometric traits provides exact predicates but approximate constructions. More...

class	CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
	A constrained triangulation is a triangulation of a set of points which has to include among its edges a given set of segments joining the points. More...

class	CGAL::Constrained_triangulation_plus_2< Tr >
	The class `Constrained_triangulation_plus_2` implements a constrained triangulation with an additional data structure called the constraint hierarchy that keeps track of the input constraints and of their refinement in the triangulation. More...

class	CGAL::Delaunay_triangulation_2< Traits, Tds >
	The class `Delaunay_triangulation_2` is designed to represent the Delaunay triangulation of a set of points in a plane. More...

class	CGAL::Regular_triangulation_2< Traits, Tds >
	The class `Regular_triangulation_2` is designed to maintain the regular triangulation of a set of weighted points. More...

class	CGAL::Triangulation_2< Traits, Tds >
	The class `Triangulation_2` is the basic class designed to handle triangulations of set of points ${ A}$ in the plane. More...

class	CGAL::Triangulation_hierarchy_2< Tr >
	The class `Triangulation_hierarchy_2` implements a triangulation augmented with a data structure which allows fast point location queries. More...