\( \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.3 - 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]

boost |
graph_traits< CGAL::Arrangement_2< T, DC > > | The class `graph_traits` is a partial specialization of `boost::graph_traits` for the class `CGAL::Arrangement_2`
graph_traits< CGAL::Polyhedron_3< T > > | The class `graph_traits` is a partial specialization of `boost::graph_traits` for the class `CGAL::Polyhedron_3`
graph_traits< CGAL::Triangulation_2< GT, TDS > > | The class `graph_traits` is a partial specialization of `boost::graph_traits` for the 2D triangulation classes
CGAL |
halfedge_graph_traits | The class `halfedge_graph_traits` is a traits class for `HalfedgeGraph`
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
HalfedgeGraph | The concept `HalfedgeGraph` describes the requirements for a graph that is structurally equivalent to a polyhedral surface represented by a halfedge data structure, and it provides an interface for efficient access to the opposite edge of an edge, and to the successor and predecessor of an edge in the iterator range of the incoming edges of a vertex. Each vertex has a geometric position in space. As in a halfedge data structure we define the face adjacent to a halfedge to be to the left of the halfedge