CGAL 4.3 - CGAL and the Boost Graph Library
|
![]() ![]() | |
![]() ![]() ![]() | The class graph_traits is a partial specialization of boost::graph_traits for the class CGAL::Arrangement_2 |
![]() ![]() ![]() | The class graph_traits is a partial specialization of boost::graph_traits for the class CGAL::Polyhedron_3 |
![]() ![]() ![]() | The class graph_traits is a partial specialization of boost::graph_traits for the 2D triangulation classes |
![]() ![]() | |
![]() ![]() ![]() | The class halfedge_graph_traits is a traits class for HalfedgeGraph |
![]() ![]() ![]() | The class HalfedgeDS_face_max_base_with_id is a model of the HalfedgeDSFace concept |
![]() ![]() ![]() | The class HalfedgeDS_halfedge_max_base_with_id is a model of the HalfedgeDSHalfedge concept |
![]() ![]() ![]() | The class HalfedgeDS_vertex_max_base_with_id is a model of the HalfedgeDSVertex concept |
![]() ![]() ![]() | The class Polyhedron_items_with_id_3 is a model of the PolyhedronItems_3 concept |
![]() ![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | |
![]() ![]() ![]() | The class Triangulation_vertex_base_with_id_2 is a model of the concept TriangulationVertexBase_2 , the base vertex of a 2D-triangulation |
![]() ![]() | 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 |