Member CGAL::Constrained_triangulation_2< Traits, Tds, Itag >::Constraint: The type of constraints.
Member CGAL::Constrained_triangulation_plus_2< Tr >::vertices_in_constraint_begin (Vertex_handle va, Vertex_handle vb) const: Returns an iterator on the first vertex on the constraint cid.
Member CGAL::Constrained_triangulation_plus_2< Tr >::vertices_in_constraint_end (Vertex_handle va, Vertex_handle vb) const: Returns an iterator past the last vertex on the constraint cid.
Class CGAL::Triangulation_euclidean_traits_xy_3< K >: The class Triangulation_euclidean_traits_xy_3 is a geometric traits class which allows to triangulate a terrain. This traits class is designed to build a two dimensional triangulation embedded in 3D space, i.e. a triangulated surface, such that its on the $xy$ plane is a Delaunay triangulation. This is a usual construction for GIS terrains. Instead of really projecting the 3D points and maintaining a mapping between each point and its projection (which costs space and is error prone) the class Triangulation_euclidean_traits_xy_3 supplies geometric predicates that ignore the z-coordinate of the points.