\( \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.8 - CGAL and the Boost Graph Library

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2 3]

CGAL |
Euler |
internal | Operation on faces
IsTerminalDefault |
Dummy_visitor_for_split_graph_into_polylines |
HalfedgeDS_face_max_base_with_id | The class `HalfedgeDS_face_max_base_with_id` is a model of the `HalfedgeDSFace` concept
HalfedgeDS_halfedge_max_base_with_id | The class `HalfedgeDS_halfedge_max_base_with_id` is a model of the `HalfedgeDSHalfedge` concept
HalfedgeDS_vertex_max_base_with_id | The class `HalfedgeDS_vertex_max_base_with_id` is a model of the `HalfedgeDSVertex` concept
Polyhedron_items_with_id_3 | The class `Polyhedron_items_with_id_3` is a model of the `PolyhedronItems_3` concept
Face_wrapper |
Vertex_wrapper |
Triangulation_vertex_base_with_id_2 | The class `Triangulation_vertex_base_with_id_2` is a model of the concept `TriangulationVertexBase_2`, the base vertex of a 2D-triangulation
Halfedge_around_source_iterator | A bidirectional iterator with value type `boost::graph_traits<Graph>::halfedge_descriptor` over all halfedges having the same vertex as source
Halfedge_around_target_iterator | A bidirectional iterator with value type `boost::graph_traits<Graph>::halfedge_descriptor` over all halfedges having the same vertex as target
Halfedge_around_face_iterator | A bidirectional iterator with value type `boost::graph_traits<Graph>::halfedge_descriptor` over all halfedges incident to the same face or border
Halfedge_around_target_circulator | A bidirectional circulator with value type `boost::graph_traits<Graph>::halfedge_descriptor` over all halfedges having the same vertex as target
Halfedge_around_source_circulator | A bidirectional circulator with value type `boost::graph_traits<Graph>::halfedge_descriptor` over all halfedges having the same vertex as source
Face_around_target_circulator | A bidirectional circulator with value type `boost::graph_traits<Graph>::face_descriptor` over all faces incident to the same vertex
Halfedge_around_face_circulator | A bidirectional circulator with value type `boost::graph_traits<Graph>::halfedge_descriptor` over all halfedges incident to the same face or border
Face_around_face_iterator | A bidirectional iterator with value type `boost::graph_traits<Graph>::face_descriptor`
Face_around_face_circulator | A bidirectional circulator with value type `boost::graph_traits<Graph>::face_descriptor`
Face_around_target_iterator |
Vertex_around_face_circulator |
Vertex_around_face_iterator | A bidirectional iterator with value type `boost::graph_traits<Graph>::vertex_descriptor` over all vertices incident to the same face or border
Opposite_edge_around_face_iterator |
Vertex_around_target_circulator | A bidirectional circulator with value type `boost::graph_traits<Graph>::vertex_descriptor` over all vertices adjacent to the same vertex
Vertex_around_target_iterator |
Out_edge_iterator |
In_edge_iterator |
FaceGraph | The concept `FaceGraph` refines the concept `HalfedgeGraph`. It adds the requirements for a graph to explicitly maintain faces described by halfedges, to provide access from a face to an incident halfedge, and to provide access from a halfedge to its incident face
FaceListGraph | The concept `FaceListGraph` refines the concept `FaceGraph` and adds the requirement for traversal of all faces in a graph
HalfedgeGraph | The concept `HalfedgeGraph` is a refinement of the Bgl concept `Graph` and adds the notion of a halfedge: Each edge is associated with two opposite halfedges with source and target vertices swapped. Furthermore, halfedges have a successor and predecessor, and form cycles we call faces. However, this concept does not introduce a face type. A `HalfedgeGraph` is undirected and does not allow parallel edges
HalfedgeListGraph | The concept `HalfedgeListGraph` refines the concept `HalfedgeGraph` and adds the requirements for traversal of all halfedges in the graph
MutableFaceGraph | The concept `MutableFaceGraph` refines the concepts `FaceGraph` and `MutableHalfedgeGraph` and adds the requirement for operations to add faces and to modify face-halfedge relations
MutableHalfedgeGraph | The concept `MutableHalfedgeGraph` refines the concept `HalfedgeGraph` and adds the requirements for operations to add vertices and edges, and to update the incidence information between vertices and halfedges