CGAL 6.0.1 - 2D Triangulations
|
Classes | |
class | Constrained_Delaunay_triangulation_2 |
A constrained Delaunay triangulation is a triangulation with constrained edges which tries to be as much Delaunay as possible. More... | |
class | Constrained_triangulation_2 |
A constrained triangulation is a triangulation of a set of points which has to include among its edges a given set of polylines joining the points. More... | |
class | Constrained_triangulation_face_base_2 |
The class Constrained_triangulation_face_base_2 is the default model for the concept ConstrainedTriangulationFaceBase_2 to be used as base face class of constrained triangulations. More... | |
class | Constrained_triangulation_plus_2 |
The class Constrained_triangulation_plus_2<Tr> provides a constrained triangulation with an additional data structure that keeps track of the input constraints and of their refinement in the triangulation. More... | |
class | Delaunay_triangulation_2 |
The class Delaunay_triangulation_2 is designed to represent the Delaunay triangulation of a set of points in a plane. More... | |
struct | Exact_intersections_tag |
Intersection tag for constrained triangulations, if exact predicates and exact constructions are provided. More... | |
struct | Exact_predicates_tag |
Intersection tag for constrained triangulations, if the geometric traits provides exact predicates but approximate constructions. More... | |
struct | No_constraint_intersection_requiring_constructions_tag |
Intersection tag for constrained triangulations, when input constraints are not allowed to intersect except if the intersection does not require any new point construction. More... | |
struct | No_constraint_intersection_tag |
Intersection tag for constrained triangulations, when input constraints are not allowed to intersect except at a single common extremity. More... | |
struct | No_intersection_tag |
Intersection tag for constrained triangulations, when input constraints do not intersect. More... | |
class | Regular_triangulation_2 |
The class Regular_triangulation_2 is designed to maintain the regular triangulation of a set of weighted points. More... | |
class | Regular_triangulation_face_base_2 |
The class Regular_triangulation_face_base_2 is a model of the concept RegularTriangulationFaceBase_2 . More... | |
class | Regular_triangulation_vertex_base_2 |
The class Regular_triangulation_vertex_base_2 is a model of the concept RegularTriangulationVertexBase_2 . More... | |
class | Triangulation_2 |
The class Triangulation_2 is the basic class designed to handle triangulations of set of points \( { A}\) in the plane. More... | |
class | Triangulation_cw_ccw_2 |
The class Triangulation_cw_ccw_2 offers two functions int cw(int i) and int ccw(int i) which, given the index of a vertex in a face, compute the index of the next vertex of the same face in clockwise or counterclockwise order. More... | |
class | Triangulation_face_base_2 |
The class Triangulation_face_base_2 is a model for the concept TriangulationFaceBase_2 . More... | |
class | Triangulation_face_base_with_info_2 |
The class Triangulation_face_base_with_info_2 is a model of the concept TriangulationFaceBase_2 to be plugged into the triangulation data structure of a triangulation class. More... | |
class | Triangulation_hierarchy_2 |
The class Triangulation_hierarchy_2 implements a triangulation augmented with a data structure which allows fast point location queries. More... | |
class | Triangulation_hierarchy_vertex_base_2 |
The class Triangulation_hierarchy_vertex_base_2 is designed to be used as a vertex base class of a triangulation plugged into a Triangulation_hierarchy_2<Tr> . More... | |
class | Triangulation_vertex_base_2 |
The class Triangulation_vertex_base_2 is the default model for the concept TriangulationVertexBase_2 . More... | |
class | Triangulation_vertex_base_with_info_2 |
The class Triangulation_vertex_base_with_info_2 is designed to be used as a base vertex class of a triangulation. More... | |
Functions | |
template<class CT2 , class InDomainPMap > | |
void | draw (const CT2 &ct2, InDomainPMap ipm) |
opens a new window and draws a constrained triangulation. | |
template<class CT2 , class InDomainPMap > | |
void | add_to_graphics_scene (const CT2 &ct2, InDomainPMap ipm, CGAL::Graphics_scene &gs) |
adds the vertices, edges and faces of ct2 into the given graphic scene gs . | |
template<class T2 , class GSOptions > | |
void | draw (const T2 &at2, const GSOptions &gso) |
opens a new window and draws a triangulation. | |
template<class T2 > | |
void | draw (const T2 &at2) |
A shortcut to CGAL::draw(at2, Graphics_scene_options{}) . | |
template<class T2 , class GSOptions > | |
void | add_to_graphics_scene (const T2 &at2, CGAL::Graphics_scene &gs, const GSOptions &gso) |
adds the vertices, edges and faces of at2 into the given graphic scene gs . | |
template<class T2 > | |
void | add_to_graphics_scene (const T2 &at2, CGAL::Graphics_scene &gs) |
A shortcut to CGAL::add_to_graphics_scene(at2, gs, Graphics_scene_options{}) . | |
template<typename CT , typename InDomainPmap > | |
void | mark_domain_in_triangulation (CT &ct, InDomainPmap ipm) |
marks faces connected with non constrained edges as inside of the domain based on the nesting level. | |
template<typename CT > | |
void | mark_domain_in_triangulation (CT &ct) |
marks faces connected with non constrained edges as inside of the domain based on the nesting level. | |