CGAL 5.4 - Halfedge Data Structures
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 12]
 NCGAL
 CHalfedgeDS_const_decoratorThe class CGAL::HalfedgeDS_items_decorator<HDS> provides additional functions for vertices, halfedges, and faces of a halfedge data structure without knowing the containing halfedge data structure
 CHalfedgeDS_decoratorThe class CGAL::HalfedgeDS_items_decorator<HDS> provides additional functions for vertices, halfedges, and faces of a halfedge data structure without knowing the containing halfedge data structure
 CHalfedgeDS_defaultThe class HalfedgeDS_default is a model for the HalfedgeDS concept
 CHalfedgeDS_face_baseThe class HalfedgeDS_face_base is a model of the HalfedgeDSFace concept
 CHalfedgeDS_face_min_baseThe class HalfedgeDS_face_min_base is a model of the HalfedgeDSFace concept
 CHalfedgeDS_halfedge_baseThe class HalfedgeDS_halfedge_base is a model of the HalfedgeDSHalfedge concept
 CHalfedgeDS_halfedge_min_baseThe class HalfedgeDS_halfedge_min_base is a model of the HalfedgeDSHalfedge concept
 CHalfedgeDS_items_2The class HalfedgeDS_items_2 is a model of the HalfedgeDSItems concept
 CHalfedgeDS_items_decoratorThe class CGAL::HalfedgeDS_items_decorator<HDS> provides additional functions for vertices, halfedges, and faces of a halfedge data structure without knowing the containing halfedge data structure
 CHalfedgeDS_listThe class HalfedgeDS_list is a model for the HalfedgeDS concept
 CHalfedgeDS_min_itemsThe class HalfedgeDS_min_items is a model of the HalfedgeDSItems concept
 CHalfedgeDS_vectorThe class HalfedgeDS_vector is a model for the HalfedgeDS concept
 CHalfedgeDS_vertex_baseThe class HalfedgeDS_vertex_base is a model of the HalfedgeDSVertex concept
 CHalfedgeDS_vertex_min_baseThe class HalfedgeDS_vertex_min_base is a model of the HalfedgeDSVertex concept
 CHalfedgeDSThe concept of a halfedge data structure (abbreviated as HalfedgeDS, or HDS for template parameters) defines an edge-centered data structure capable of maintaining incidence information of vertices, edges, and faces, for example for planar maps or polyhedral surfaces. It is a combinatorial data structure, geometric interpretation is added by classes built on top of the halfedge data structure
 CHalfedgeDSFaceThe concept HalfedgeDSFace defines the requirements for the local Face type in the HalfedgeDS concept. It is also required in the Face_wrapper<Refs,Traits> member class template of an items class, see the HalfedgeDSItems concept
 CHalfedgeDSHalfedgeThe concept HalfedgeDSHalfedge defines the requirements for the local Halfedge type in the HalfedgeDS concept. It is also required in the Halfedge_wrapper<Refs,Traits> member class template of an items class, see the HalfedgeDSItems concept
 CHalfedgeDSItemsThe concept HalfedgeDSItems wraps the three item types - vertex, halfedge, and face - for a halfedge data structure. A HalfedgeDSItems contains three member class templates named Vertex_wrapper, Halfedge_wrapper, and Face_wrapper, each with two template parameters, Refs and Traits. Refs requires an instantiated halfedge data structure HalfedgeDS as argument, Traits is a geometric traits class supplied by the class that uses the halfedge data structure as internal representation. Traits is not used by the halfedge data structure itself. These three member class templates provide a local type named Vertex, Halfedge, and Face respectively. The requirements on these types are described on the manual pages of the concepts HalfedgeDSVertex, HalfedgeDSHalfedge, and HalfedgeDSFace respectively
 CHalfedgeDSVertexThe concept HalfedgeDSVertex defines the requirements for the local Vertex type in the HalfedgeDS concept. It is also required in the Vertex_wrapper<Refs,Traits> member class template of an items class, see the HalfedgeDSItems concept