Processing math: 100%
CGAL 4.9 - 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 123]
oNboostBoost Namespace
|oNinternal
||oCDual_vertex_index_pmap
||oCDual_face_index_pmap
||oCDual_property_maps
||\CDual_property_maps< P, Property, false >
|oCgraph_traits< CGAL::Dual< Primal > >
|oCgraph_traits< const CGAL::Dual< P > >
|oCproperty_map< CGAL::Dual< P >, Property >
|oCproperty_map< CGAL::Dual< P >, boost::vertex_index_t >
|\Cproperty_map< CGAL::Dual< P >, boost::face_index_t >
oNCGAL
|oNEuler
|oNinternalOperation on faces
||oCIsTerminalDefault
||\CDummy_visitor_for_split_graph_into_polylines
|oCHalfedgeDS_face_max_base_with_idThe class HalfedgeDS_face_max_base_with_id is a model of the HalfedgeDSFace concept
|oCHalfedgeDS_halfedge_max_base_with_idThe class HalfedgeDS_halfedge_max_base_with_id is a model of the HalfedgeDSHalfedge concept
|oCHalfedgeDS_vertex_max_base_with_idThe class HalfedgeDS_vertex_max_base_with_id is a model of the HalfedgeDSVertex concept
|oCPolyhedron_items_with_id_3The class Polyhedron_items_with_id_3 is a model of the PolyhedronItems_3 concept
||oCFace_wrapper
||\CVertex_wrapper
|oCTriangulation_vertex_base_with_id_2The class Triangulation_vertex_base_with_id_2 is a model of the concept TriangulationVertexBase_2, the base vertex of a 2D-triangulation
|oCHalfedge_around_source_iteratorA bidirectional iterator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges having the same vertex as source
|oCHalfedge_around_target_iteratorA bidirectional iterator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges having the same vertex as target
|oCHalfedge_around_face_iteratorA bidirectional iterator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges incident to the same face or border
|oCHalfedge_around_target_circulatorA bidirectional circulator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges having the same vertex as target
|oCHalfedge_around_source_circulatorA bidirectional circulator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges having the same vertex as source
|oCFace_around_target_circulatorA bidirectional circulator with value type boost::graph_traits<Graph>::face_descriptor over all faces incident to the same vertex
|oCHalfedge_around_face_circulatorA bidirectional circulator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges incident to the same face or border
|oCFace_around_face_iteratorA bidirectional iterator with value type boost::graph_traits<Graph>::face_descriptor
|oCFace_around_face_circulatorA bidirectional circulator with value type boost::graph_traits<Graph>::face_descriptor
|oCFace_around_target_iterator
|oCVertex_around_face_circulator
|oCVertex_around_face_iteratorA bidirectional iterator with value type boost::graph_traits<Graph>::vertex_descriptor over all vertices incident to the same face or border
|oCOpposite_edge_around_face_iterator
|oCVertex_around_target_circulatorA bidirectional circulator with value type boost::graph_traits<Graph>::vertex_descriptor over all vertices adjacent to the same vertex
|oCVertex_around_target_iterator
|oCOut_edge_iterator
|oCIn_edge_iterator
|oCDualThe class template Dual is an adaptor that creates the dual view of a FaceGraph
|\CProperty_map_value_dummy
oCFaceGraphThe 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
oCFaceListGraphThe concept FaceListGraph refines the concept FaceGraph and adds the requirement for traversal of all faces in a graph
oCHalfedgeGraphThe 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
oCHalfedgeListGraphThe concept HalfedgeListGraph refines the concept HalfedgeGraph and adds the requirements for traversal of all halfedges in the graph
oCMutableFaceGraphThe concept MutableFaceGraph refines the concepts FaceGraph and MutableHalfedgeGraph and adds the requirement for operations to add faces and to modify face-halfedge relations
\CMutableHalfedgeGraphThe 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