\( \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 5.0.3 - Halfedge Data Structures
CGAL::HalfedgeDS_min_items Class Reference

#include <CGAL/HalfedgeDS_min_items.h>

Definition

The class HalfedgeDS_min_items is a model of the HalfedgeDSItems concept.

It defines types for vertices, halfedges, and faces that declare the minimal required incidences for a HalfedgeDS, which are the next() and the opposite() member function for halfedges.

Is Model Of:
HalfedgeDSItems
See also
CGAL::HalfedgeDS_items_2
CGAL::Polyhedron_items_3
HalfedgeDS<Traits,Items,Alloc>
PolyhedronItems_3
CGAL::HalfedgeDS_vertex_min_base<Refs>
CGAL::HalfedgeDS_halfedge_min_base<Refs>
CGAL::HalfedgeDS_face_min_base<Refs>

Example

The following example shows the canonical implementation of the CGAL::HalfedgeDS_min_items class. It uses the base classes for the item types that are provided in the library.

struct HalfedgeDS_min_items {
template < class Refs, class Traits>
struct Vertex_wrapper {
};
template < class Refs, class Traits>
struct Halfedge_wrapper {
};
template < class Refs, class Traits>
struct Face_wrapper {
};
};
Examples:
HalfedgeDS/hds_prog_graph2.cpp.